12692
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
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 23520
- Proper Divisor Sum (Aliquot Sum)
- 10828
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5976
- Möbius Function
- 0
- Radical
- 6346
- Omega Function (Ω)
- 4
- 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
- 81
- 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
- a(n) = Sum_{k=1..n} floor((n/k) * floor((n/k) * floor(n/k))).at n=21A024922
- Number of proper factorizations of p1^n*p2^7, where p1 and p2 are distinct primes.at n=10A031130
- 20-gonal (or icosagonal) numbers: a(n) = n*(9*n-8).at n=38A051872
- Number of n X n matrices over GF(3) of order dividing 2 (i.e., number of solutions of X^2=I in GL(n,3)).at n=4A053846
- Numbers k such that k and its reversal are both multiples of 19.at n=35A062907
- Non-palindromic number and its reversal are both multiples of 19.at n=24A062916
- a(n) = first number that appears n times in A080900.at n=6A080912
- Icosagonal numbers for which the sum of the digits is also an icosagonal number.at n=3A117799
- Number of arrangements of n+2 nonzero numbers x(i) in -3..3 with the sum of x(i)*x(i+1) equal to zero.at n=4A188243
- T(n,k)=Number of arrangements of n+2 nonzero numbers x(i) in -k..k with the sum of x(i)*x(i+1) equal to zero.at n=25A188249
- Number of arrangements of 7 nonzero numbers x(i) in -n..n with the sum of x(i)*x(i+1) equal to zero.at n=2A188253
- Position of 2^n in A051037 (5-smooth numbers).at n=63A188425
- Numbers n with nonzero digits such that n*(product of digits of n) is a palindrome.at n=33A229550
- Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) = number of distinct parts of p.at n=47A241820
- Number of collections of nonempty multisets with a total of n objects of exactly two colors.at n=11A255942
- Number of partitions of 6n into 6 parts.at n=10A256226
- Number of partitions of 2n into exactly 6 parts.at n=30A256310
- Number of partitions of 3n into exactly 6 parts.at n=20A256315
- Number of partitions of 4n into exactly 6 parts.at n=15A256317
- Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 33", based on the 5-celled von Neumann neighborhood.at n=6A269811