12570
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 30240
- Proper Divisor Sum (Aliquot Sum)
- 17670
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3344
- Möbius Function
- 1
- Radical
- 12570
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 125
- 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
- Numbers k such that sigma(k) divides sigma(sigma(k)).at n=41A066961
- Antidiagonal sums of triangle A097094, where self-convolution forms A097096 (row sums of triangle A097094).at n=23A097097
- G.f. A(x) satisfies A(x/A(x)^2) = 1/(1-x).at n=6A145158
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (0, 0, 1), (0, 1, -1), (1, 0, 0)}.at n=8A150059
- Number of 8-element subsets of {1, 2, ..., n} having pairwise coprime elements.at n=16A186984
- a(n) = n*(14*n - 1).at n=30A195024
- Numbers n for which n' + n and n' - n are both prime, n' being the arithmetic derivative of n.at n=33A229272
- G.f.: Sum_{n>=0} x^n * Product_{k=1..n} (1 - x^(n+k))/(1 - x^k).at n=37A260894
- Least positive integer k such that (k-1)^2+(k*n)^2, k^2+(k*n-1)^2, (k+1)^2+(k*n)^2 and k^2+(k*n+1)^2 are all prime.at n=14A261382
- Number of length-n 0..4 arrays with no repeated value differing from the previous repeated value by one or less.at n=5A269602
- T(n,k)=Number of length-n 0..k arrays with no repeated value differing from the previous repeated value by one or less.at n=41A269606
- Number of length-6 0..n arrays with no repeated value differing from the previous repeated value by one or less.at n=3A269609
- a(n) = A273059(4n+3).at n=19A275919
- a(n) is the number of labeled 2-connected planar graphs with n edges.at n=5A291841
- Triangle read by rows: T(n,k) is the number of non-backtracking walks on Z^2 of length n that are active for k steps, where the walk is initially active and turns in the walk toggle the activity.at n=61A307584
- Triangle read by rows: T(n,k) is the number of non-backtracking walks on Z^2 of length n that are active for k steps, where the walk is initially active and turns in the walk toggle the activity.at n=63A307584
- Number of labeled 2-connected simple graphs with n edges (the vertices are {1,2,...,k} for some k).at n=8A322139
- Numbers k such that the odd part of sigma(sigma(k)) is equal to the odd part of sigma(k).at n=29A353365
- Indices of high points in A245340.at n=16A370959
- Ulam numbers that are products of exactly four distinct primes (or tetraprimes).at n=43A379532