9668
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 16926
- Proper Divisor Sum (Aliquot Sum)
- 7258
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4832
- Möbius Function
- 0
- Radical
- 4834
- 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
- 21
- 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
- Numbers n such that in n^3 the parity of digits alternates.at n=25A030159
- Multiplicity of highest weight (or singular) vectors associated with character chi_97 of Monster module.at n=37A034485
- Starting from generation 6 add previous and next term yielding generation 7.at n=35A048453
- Number of Sophie Germain primes <= prime(10^n).at n=5A049040
- Numbers k such that k^16 == 1 (mod 17^3).at n=30A056088
- Numbers n such that n | 9^n + 7^n + 5^n + 3^n.at n=17A063455
- a(n)=floor{square((1*n^0+1*n^1+2*n^2+4*n^3)/(1*n^0+2*n^1+1*n^2))}.at n=25A086863
- Self-convolution omits 1's at positions of triangular numbers less one.at n=25A105613
- Self-convolution of A105613.at n=19A105614
- Number of sequences b with last index n with b(0) = 1, b(i+1) = b(i)+d where d|b(i).at n=8A122206
- Base-2 logarithm of (n-th even superperfect number divided by 2^n), plus 1.at n=20A134713
- Number of n X n 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 0 and 1 1 1 vertically.at n=4A207340
- Number of nX5 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 0 and 1 1 1 vertically.at n=4A207343
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 0 and 1 1 1 vertically.at n=40A207346
- Number of 5Xn 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 0 and 1 1 1 vertically.at n=4A207349
- Expansion of Product_{k>=1} ((1 + x^k) * (1 + 3*x^k)).at n=16A266822
- Numbers that are the sum of eight fourth powers in six or more ways.at n=22A345581
- Numbers that are the sum of eight fourth powers in exactly six ways.at n=16A345838
- Numbers that are the sum of nine fourth powers in exactly seven ways.at n=29A345849
- Expansion of Product_{i>=1, j>=0} (1 + x^(i * 7^j)).at n=53A373221