16472
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 32400
- Proper Divisor Sum (Aliquot Sum)
- 15928
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7840
- Möbius Function
- 0
- Radical
- 4118
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 3
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
- 40
- 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
- yes
- Odd
- no
Appears in sequences
- Number of points on y^2 + xy = x^3 + x^2 + x over GF(2^n).at n=13A002248
- Pisot sequence L(4,10).at n=9A020734
- Expansion of (theta_3(z)*theta_3(23z)+theta_2(z)*theta_2(23z))^4.at n=32A028660
- Fibonacci iteration starting with (1, a(n)) leads to a "nine digits anagram".at n=25A034587
- Let F(x) = 1 + 1*x + 4*x^2 + 10*x^3 + ..., the g.f. for A000293 (solid partitions), and write F(x) = 1/Product_{n>=1} (1 - x^n)^a(n).at n=22A037452
- Numbers whose base-4 representation contains exactly four 0's and three 1's.at n=27A045036
- Numbers n such that phi(n) = sigma(n) - sigma(n+1).at n=3A063943
- Numbers k such that phi(k) divides sigma(k+1) - sigma(k).at n=40A072611
- Sum of multinomials of (-1 + number of runs) in the partitions of n.at n=21A080528
- Column 6 of triangle A091602.at n=43A091609
- Numbers n such that A001414(n) = sum of squared digits of n.at n=31A094908
- Row sums of triangle A115237.at n=28A115238
- n+phi(n)+phi(phi(n)) is a cube.at n=14A116042
- Sum of the odd parts in all partitions of n into distinct parts.at n=38A116682
- Numbers n such that sigma(n) and sigma(sigma(n)) are both perfect squares.at n=18A134263
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 1), (-1, 1, 1), (1, 0, 1), (1, 1, -1)}.at n=8A149419
- Number of ordered triples (w,x,y) with all terms in {1,...,n} and w^2>x^2+y^2.at n=40A211637
- Positions of 2 in sequence A217916.at n=23A217918
- Number of length 3 1..(n+1) arrays with every leading partial sum divisible by 2, 3, 5, 7 or 11.at n=31A254950
- Zeroless numbers n whose digit product squared is equal to the digit product of n^2.at n=16A256115