12170
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 21924
- Proper Divisor Sum (Aliquot Sum)
- 9754
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4864
- Möbius Function
- -1
- Radical
- 12170
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 112
- 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
- Coordination sequence for body-centered tetragonal lattice.at n=39A008527
- a(0) = 1, a(n) = 18*n^2 + 2 for n>0.at n=26A010008
- Powers of fourth root of 6 rounded down.at n=21A018060
- Powers of fourth root of 6 rounded to nearest integer.at n=21A018061
- Number of partitions satisfying cn(1,5) <= cn(0,5) + cn(2,5) + cn(3,5) and cn(4,5) <= cn(0,5) + cn(2,5) + cn(3,5).at n=36A039870
- Triangle of number of falls in set partitions of n.at n=49A056859
- Triangle of numbers {a(n,k), n >= 0, 0<=k<=n} defined by a(0,0)=1, a(1,0)=2, a(n,0)=A006318(n), a(n,n)=A006319(n), a(n+1,0)=a(n,0)+a(n,n), a(n,m+1)= Sum A006318(k)*a(n-k,0), k=0..m.at n=29A073150
- Triangle T(m,n) read by rows: unimodular triangulations of the grid P(m,n), m,n > 0, n <= m.at n=7A082640
- a(n) = n^3 + 3.at n=23A084378
- a(n) = (2*n-1)^2 + (2*n+1)^2.at n=39A108100
- The constant for the smallest n X n associative magic square which consists of Smith numbers.at n=2A189121
- Number of right triangles on an (n+1) X 3 grid.at n=42A189807
- Related to Pisano periods: numbers n such that there are n+10 distinct Fibonacci numbers mod n.at n=35A229467
- Number of nX7 0..2 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of elements above it or one plus the sum of the elements diagonally to its northwest, modulo 3.at n=14A239360
- Number of compositions of n in which the maximal multiplicity of parts equals 5.at n=12A243122
- Nonprimes such that it takes exactly 4 iterations of reverse-and-add digits to generate a prime.at n=23A245209
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 141", based on the 5-celled von Neumann neighborhood.at n=25A270284
- 1^2 + 3^2, 2^2 + 4^2, 5^2 + 7^2, 6^2 + 8^2, ...at n=38A276764
- Numbers n such that there is exactly one nontrivial square n-gonal number.at n=56A277449
- a(n) is the number of unimodular triangulations of [0,2]x[0,n].at n=3A296165