16475
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 20460
- Proper Divisor Sum (Aliquot Sum)
- 3985
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13160
- Möbius Function
- 0
- Radical
- 3295
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 97
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of partitions of n into at most 7 parts.at n=49A008636
- Number of partitions of n with equal number of parts congruent to each of 0 and 4 (mod 5).at n=43A035555
- Partial sums of A001157: Sum_{j=1..n} sigma_2(j).at n=33A064602
- a(n) = Sum_{k=0..n} C(n-k, floor(k/2))*2^k.at n=14A097334
- Number of partitions of n into parts not greater than sqrt(n).at n=49A097356
- a(n) is the number of partitions of n into parts not greater than A020639(n).at n=48A097359
- Numbers n such that (2^n+1)^3-2 is prime.at n=5A100900
- Number of base 9 n-digit numbers with adjacent digits differing by two or less.at n=6A126396
- Number of x X n symmetric binary matrices containing no more than three 1s in any 2 X 2 sub-block.at n=5A139008
- This is to A139025 as A139025 to A014688, see A139025 for details.at n=27A139026
- Number of n X n binary matrices, symmetric about the diagonal and under 90-degree rotation, with no more than 3 ones in any 2 X 2 subblock.at n=9A141512
- Number of partitions of n^2 into parts not greater than n.at n=7A206226
- Years >= 1801 in which Christmas falls in Sukkot.at n=14A222419
- Total sum of parts of multiplicity 3 in all partitions of n.at n=32A222731
- Number A(n,k) of partitions of n^k into parts that are at most n; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=52A238016
- Number of partitions of 7^n into parts that are at most 7.at n=2A238634
- Number of partitions of 7n into 7 parts.at n=8A256287
- Numbers missing from A001032 despite satisfying the necessary congruence conditions (see comments).at n=40A274469
- Number of partitions of n into 7 distinct and relatively prime parts.at n=49A339672
- Starting from k=9, each subsequent term is the next larger odd k such that A005940(k) <= k and the ratio A005940(k)/k is nearer to 1.0 than for any previous k in the sequence.at n=4A364573