12492
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
- 3
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 31668
- Proper Divisor Sum (Aliquot Sum)
- 19176
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4152
- Möbius Function
- 0
- Radical
- 2082
- 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
- 63
- 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 whose base-4 representation contains exactly four 0's and three 3's.at n=4A045084
- Expansion of 4th power of continued fraction 1/ ( 1+q/ ( 1+q^2/ ( 1+q^3/ ( 1+q^4/... )))).at n=34A055103
- a(n) = 961*n - 1.at n=12A158412
- Number of 5-step self-avoiding walks on an n X n square summed over all starting positions.at n=12A188150
- Number of nX2 0..6 arrays with every row and column nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.at n=20A201066
- Number of length n+1 nonnegative integer arrays starting and ending with 0 with adjacent elements differing by no more than 3.at n=6A204208
- T(n,k) = Number of length n+1 nonnegative integer arrays starting and ending with 0 with adjacent elements differing by no more than k.at n=42A204213
- Number of length 8 nonnegative integer arrays starting and ending with 0 with adjacent elements differing by no more than n.at n=2A204216
- Half the number of (n+1)X(n+1) 0..3 arrays with every 2X2 subblock having exactly one duplicate clockwise edge difference.at n=1A209779
- Half the number of (n+1)X3 0..3 arrays with every 2X2 subblock having exactly one duplicate clockwise edge difference.at n=1A209781
- T(n,k)=Half the number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having exactly one duplicate clockwise edge difference.at n=4A209787
- 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 parts of p.at n=43A241831
- Permuted compound filter: a(n) = A286458(A064216(n)).at n=65A286459
- Column 2 of triangle in A288187.at n=10A333279
- Numbers k such that k and k + 1 are both Niven numbers in base 3/2 (A342426).at n=24A342427
- a(n) is the number of solid (3D) partitions of n with 2 layers and second layer a plane partition of 3.at n=10A381265
- a(1) = 2; for n > 1, a(n) = a(n-1)*prime(n) if a(n-1)<=prime(n), otherwise a(n) = a(n-1)-prime(n).at n=42A382619