1002
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 3
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 2016
- Proper Divisor Sum (Aliquot Sum)
- 1014
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 332
- Möbius Function
- -1
- Radical
- 1002
- Omega Function (Ω)
- 3
- 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
- 111
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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(n) is the number of partitions of n (the partition numbers).at n=22A000041
- Numbers written in base of triangular numbers.at n=11A000462
- a(1)=0, a(2n) = a(n)+1, a(2n+1) = 10*a(n+1).at n=35A001202
- Primes in ternary.at n=9A001363
- a(n) = 2 * Sum_{k=0..n-1} binomial(n-1, k)*binomial(n+k, k).at n=5A002003
- Number of equivalence classes of base-3 necklaces of length n, where necklaces are considered equivalent under both rotations and permutations of the symbols.at n=10A002076
- Number of maximal collections of pairwise disjoint subsets {X,Y,Z} of {1, 2, ..., n}, each satisfying X + Y = Z.at n=16A002849
- Losing initial positions in game: two players alternate in removing >= 1 stones; last player wins; first player may not remove all stones; each move <= 3 times previous move.at n=20A003411
- Number of trees with n nodes and 2-colored internal (non-leaf) nodes.at n=9A004114
- Primes written in base 5.at n=30A004679
- Number of points on surface of cuboctahedron (or icosahedron): a(0) = 1; for n > 0, a(n) = 10n^2 + 2. Also coordination sequence for f.c.c. or A_3 or D_3 lattice.at n=10A005901
- Number of restricted hexagonal polyominoes with n cells.at n=7A005963
- Number of sensed planar maps with n edges and without loops or parallel edges.at n=8A006394
- Number of conjugacy classes in GL(n,2).at n=10A006951
- Numbers in base 3.at n=29A007089
- Number of 5-leaf rooted trees with n levels.at n=7A007715
- Some permutation of digits is a factorial number.at n=24A007926
- Some nontrivial permutation of digits is a factorial number.at n=18A007927
- n written in base where place values are positive squares.at n=17A007961
- Coordination sequence T1 for Zeolite Code JBW.at n=21A008121