12455
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15552
- Proper Divisor Sum (Aliquot Sum)
- 3097
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9568
- Möbius Function
- -1
- Radical
- 12455
- 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
- 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
- no
- Odd
- yes
Appears in sequences
- Centered tetrahedral numbers.at n=26A005894
- Expansion of (1-x^8)*(1+x^5)/(1-x^2)^5.at n=52A027635
- a(n) = floor( exp(19/21)*n! ).at n=6A030841
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 15 ones.at n=13A031783
- a(n) = (2*n+1)*(9*n+1).at n=26A033573
- Numbers k such that 60*R_k + 7 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=27A056657
- C(2*n+4,4)-C(2*n,4).at n=13A085474
- Positive integers i for which A112049(i) == 7.at n=33A112067
- Let f(p,i) = smallest prime m >= p such that m == i (mod p); a(n) = Sum_{i=0..p-1} f(p,i), where p = n-th prime.at n=15A243076
- Sums of Pythagorean sextuples in increasing order: The sums of sets of six natural numbers which correspond to the lengths of the edges of a tetrahedron whose four faces are all different Pythagorean triangles.at n=15A248548
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 157", based on the 5-celled von Neumann neighborhood.at n=25A270331
- Number of partitions of n containing a prime number of distinct primes and an arbitrary number of nonprimes.at n=36A344715
- Total sum of the left-to-right weak peak maxima in all Dyck paths of semilength n.at n=8A346195
- a(n) = (n+2)*a(n-1) + (n+1)*(A003422(n) - 4)/6 for n > 0 with a(0) = 1.at n=6A350309
- 11-gonal numbers which are products of three distinct primes.at n=12A354446
- Numbers k whose ordered binary weights (A000120) of their divisors are the numbers 1 to A000005(k).at n=35A354724
- Number of subsets of {1..n} containing n and all first differences.at n=18A364752