12729
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16976
- Proper Divisor Sum (Aliquot Sum)
- 4247
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8484
- Möbius Function
- 1
- Radical
- 12729
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- no
- Narcissistic Number
- no
- Collatz Steps
- 107
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Expansion of Product_{k>=1} (1 - x^k)^(-k^5).at n=5A023874
- a(n) = position of n^3 + (n+1)^3 + (n+2)^3 in A003072.at n=32A024972
- Square array A(n,k), n>=0, k>=0, read by antidiagonals, where column k is Euler transform of (j->j^k).at n=60A144048
- 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, -1), (0, -1, 0), (0, 1, 1), (1, 0, 0)}.at n=8A150004
- Similar to A072921 but starting with 3.at n=43A152232
- Numbers k such that tau(k-1) = (tau(k))^2 = tau(k+1), where tau(k) = A000005(k) (number of divisors of k).at n=43A190266
- Number of n X 4 arrays of the minimum value of corresponding elements and their horizontal or vertical neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..1 n X 4 array.at n=8A219287
- Sum_{i=0..n} Sum_{j=0..n} (i AND j), where AND is the binary logical AND operator.at n=41A224924
- a(n) = 7*n^2 - 5*n + 1.at n=43A239449
- a(n) = n-th term of Euler transform of n-th powers.at n=5A252782
- Number of 2 X 2 matrices with all elements in {0,...,n} and prime permanent.at n=17A281090
- Row n=5 of A144048.at n=5A283457
- Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 297", based on the 5-celled von Neumann neighborhood.at n=26A287509
- Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 429", based on the 5-celled von Neumann neighborhood.at n=28A288192
- a(n) = Sum_{k=0..n} k!!*(n - k)!!.at n=10A305577
- Number of tilings of a 16 X n rectangle using 2*n copies of the disconnected shape [oooo____oooo].at n=30A323483
- a(n) is the least k such that A345468(k) = 2*n-1.at n=45A345469
- Number of subsets of {1,2,...,n} such that no two elements differ by 3, 4, or 5.at n=24A375984