16902
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 37680
- Proper Divisor Sum (Aliquot Sum)
- 20778
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5616
- Möbius Function
- 0
- Radical
- 1878
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 58
- Smith Number
- yes
- 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
- a(0) = 1, a(n) = 25*n^2 + 2 for n > 0.at n=26A010015
- Sum of generalized tribonacci numbers (A001644) and reflected generalized tribonacci numbers (A073145).at n=16A075092
- Consider 3 X 3 X 3 Rubik cube, but consider only positions of edges; sequence gives number of positions that are exactly n moves from the start up to equivalence under the full group of order 48 of the cube.at n=6A080632
- A156977/3.at n=22A164565
- Numbers n such that there is no triangular n-gonal number greater than 1.at n=32A188892
- Number of partitions p of n such that (# 1s in p) = (#1s in conjugate(p)).at n=49A240691
- Number of pairs of partitions of n that are successors in reverse lexicographic order, but incomparable in dominance (natural, majorization) ordering.at n=44A248475
- Numbers n such that the sum of the inverse of the exponents in the binary expansion of 2n is the inverse of an integer.at n=23A272034
- Numbers n such that the sum of the inverse of the exponents in the binary expansion of 2n is an integer.at n=6A272035
- Numbers n such that the sum of the inverse of the exponents in the binary expansion of 2n is equal to 1.at n=3A272036
- Numbers of the form Sum_{e in S} 2^(e-1) where S is a finite set of positive integers such that any element of S divides the sum of the elements of S.at n=30A337744
- Least k such that A000668(n) - k is prime, where A000668(n) is the n-th Mersenne prime.at n=20A365161