Number of the day: 465

Properties of the number 465:

465 = 3 × 5 × 31 is a sphenic number and squarefree.
465 has 3 distinct prime factors, 8 divisors, 11 antidivisors and 240 totatives.
465 has an emirpimes digit sum 15 in base 10.
465 has a triangular digit sum 15 in base 10.
465 has a triangular digit product 120 in base 10.
465 = 233² - 232² = 79² - 76² = 49² - 44² = 23² - 8² is the difference of 2 nonnegative squares in 4 ways.
465 = (30 × 31)/2 is a triangular number.
465 is the difference of 2 positive pentagonal numbers in 2 ways.
465 = 10² + 13² + 14² is the sum of 3 positive squares.
465² = 279² + 372² is the sum of 2 positive squares in 1 way.
465² is the sum of 3 positive squares.
465 is a proper divisor of 61² - 1.
465 = '4' + '65' is the concatenation of 2 semiprime numbers.
465 is palindromic in (at least) the following bases: 11, 16, 30, 92, -9, -10, -14, -29, and -58.
465 in base 5 = 3330 and consists of only the digits '0' and '3'.
465 in base 9 = 566 and consists of only the digits '5' and '6'.
465 in base 11 = 393 and consists of only the digits '3' and '9'.
465 in base 16 = 1d1 and consists of only the digits '1' and 'd'.
465 in base 21 = 113 and consists of only the digits '1' and '3'.

The number 465 belongs to the following On-Line Encyclopedia of Integer Sequences (OEIS) sequences (among others):

Sequence numbers and descriptions below are taken from OEIS.
A000217: Triangular numbers: a(n) = binomial(n+1,2) = n(n+1)/2 = 0 + 1 + 2 + ... + n.
A000931: Padovan sequence (or Padovan numbers): a(n) = a(n-2) + a(n-3) with a(0)=1, a(1)=a(2)=0.
A003114: Number of partitions of n into parts 5k+1 or 5k+4.
A006046: Total number of odd entries in first n rows of Pascal's triangle: a(0) = 0, a(1) = 1, a(2k) = 3*a(k), a(2k+1) = 2*a(k) + a(k+1).
A007294: Number of partitions of n into nonzero triangular numbers.
A008137: Coordination sequence T1 for Zeolite Code LTA and RHO.
A014105: Second hexagonal numbers: a(n) = n*(2n+1).
A023896: Sum of positive integers in smallest positive reduced residue system modulo n. a(1) = 1 by convention.
A024816: Antisigma(n): Sum of the numbers less than n that do not divide n.
A108917: Number of knapsack partitions of n.