9968
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 32
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 22320
- Proper Divisor Sum (Aliquot Sum)
- 12352
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4224
- Möbius Function
- 0
- Radical
- 1246
- Omega Function (Ω)
- 6
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 135
- 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
- Size of lexicographic code of length n, Hamming distance 6 and weight 6.at n=45A031504
- Least Smith number having digital sum A033662(n).at n=19A033663
- Number of partitions of n with equal nonzero number of parts congruent to each of 1 and 2 (mod 5).at n=47A035566
- Number of partitions of n such that cn(0,5) = cn(1,5) <= cn(3,5) <= cn(2,5) = cn(4,5).at n=69A036864
- Define b by b(1) = 1 and for n > 1, b(n) = b(n-1) + 1/(2 + 1/b(n-1)); sequence gives numerator of b(n).at n=3A080984
- n-th positive integer whose digits sum up to n.at n=31A081927
- a(n) is the number k such that 2^(2k+1)-1 = A000668(n+1).at n=22A146768
- a(n) = 2^n * Product_{k=1..(n-1)/2} (2 + 3*cos(k*Pi/n)^2).at n=8A152120
- Number of binary strings of length n with no substrings equal to 0001 0010 or 0101.at n=13A164446
- Numbers in A075728 which are not one less than some prime.at n=20A179232
- n-th zerofree positive number with digital sum n.at n=31A181178
- a(n) = the largest 4-digit number with exactly n divisors, a(n) = 0 if no such number exists.at n=19A182696
- Monotonic ordering of nonnegative differences 10^i-2^j, for 40>= i>=0, j>=0.at n=30A192125
- Number of 6-line partitions of n (i.e., planar partitions of n with at most 6 lines).at n=16A225196
- Number of arrays of length n that are sums of 4 consecutive elements of length n+3 permutations of 0..n+2.at n=4A229562
- T(n,k) = number of arrays of length n that are sums of k consecutive elements of length n+k-1 permutations of 0..n+k-2.at n=32A229565
- Number of arrays of length 5 that are sums of n consecutive elements of length 5+n-1 permutations of 0..5+n-2.at n=3A229568
- Numbers k such that k + (sum of digits of k) is a power of 10.at n=3A232489
- Numbers n such that A = n + digitsum(n) is divisible by the highest power of 10 <= A.at n=28A242799
- a(n) is the largest n-digit number whose truncation after its first k digits is divisible by the k-th Lucas number (A000032(n)) for k = 1..n.at n=3A242811