12702
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 26640
- Proper Divisor Sum (Aliquot Sum)
- 13938
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4032
- Möbius Function
- 1
- Radical
- 12702
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 200
- 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 > 1 such that, in base 5, k and k^2 contain the same digits in the same proportion.at n=3A061659
- Numbers k such that k^4 + 1, (k+2)^4 + 1 and (k+4)^4 + 1 are all primes.at n=14A073476
- Third column (m=2) of triangle A060063 divided by 9.at n=2A091743
- Sum of all primes from n-th prime to (2*n-1)-th prime.at n=41A161463
- G.f. A(x) satisfies: A(x) = 1 + Sum_{n>=1} x^n*A(x)^(n!).at n=7A191799
- Triangular array read by rows. T(n,k) is the number of partial functions on {1,2,...,n} that are endofunctions with no cycles of length > 1 that have exactly k components.at n=22A203092
- Number of partitions p of n such that floor(mean(p)) or ceiling(mean(p)) is a part.at n=36A241344
- Numbers m such that (4^m + 11) / 3 is prime.at n=8A261577
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 62", based on the 5-celled von Neumann neighborhood.at n=31A270081
- E.g.f.: -exp(x)*LambertW(-x).at n=6A277473
- Number of ways to write n as an ordered sum of 6 prime power palindromes (A084092).at n=43A282845
- Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of e.g.f. -exp(k*x)*LambertW(-x).at n=34A294411
- Number of length-n binary words having exactly one nontrivial palindrome prefix.at n=14A308529
- G.f.: Product_{n>=1} (1 - 2*x^n)^3.at n=38A322216
- Numbers whose multiset multisystem (A302242) is crossing.at n=31A324170
- With p = prime(n), a(n) is the least composite k such that A001414(k) = p and k+p is prime, or 0 if there is no such k.at n=27A346501
- Numbers k such that 1 is in the transitive closure of the map x -> A353313(x) when starting iterating from x=k.at n=46A353306
- Number of vertices in a hexagon when n internal hexagons are drawn between the 6n points that divide each side into n+1 equal parts.at n=46A357197