12567
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
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17280
- Proper Divisor Sum (Aliquot Sum)
- 4713
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8120
- Möbius Function
- -1
- Radical
- 12567
- 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
- 156
- 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
- Numbers k such that the decimal part of k^(1/6) starts with a 'nine digits' anagram.at n=5A034281
- Numbers k such that 5*k! + 1 is prime.at n=25A076681
- Numbers k such that if P = 10*k^2+1, then P, P+6, P+12 and P+18 are all primes.at n=34A092446
- Having specified two initial terms, the "Half-Fibonacci" sequence proceeds like the Fibonacci sequence, except that the terms are halved before being added if they are even.at n=35A120424
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+577)^2 = y^2.at n=7A130005
- a(0) = 1, a(1) = 3; a(n+2) = (a(n+1) + a(n))/2 if 2 divides (a(n+1) + a(n)), a(n+2) = a(n+1) + a(n) otherwise.at n=35A151749
- Numerators b(n) of Pythagorean approximations b(n)/a(n) to 3/5.at n=7A195578
- Number of nX7 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 0 and 1 0 1 vertically.at n=3A207784
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 0 and 1 0 1 vertically.at n=48A207785
- Number of 4Xn 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 0 and 1 0 1 vertically.at n=6A207786
- n - (sum of prime factors of n^2+1) is a positive square.at n=37A216896
- Number of partitions of n having standard deviation σ > 3.at n=37A238655
- a(n) = ceiling(n^3*(Pi/2)).at n=19A248198
- Expansion of Sum_{k>=1} mu(k)^2*x^k*(1 - x)^2/(1 - 2*x)^2, where mu() is the Moebius function (A008683).at n=11A284942
- Number of Dyck paths of semilength n such that no positive level has fewer than seven peaks.at n=18A288683
- Number of nX5 0..1 arrays with every element equal to 1, 2 or 4 king-move adjacent elements, with upper left element zero.at n=18A297855
- Numbers k such that k, k + 1 and k + 2 are all norm-deficient in Gaussian integers (A332572).at n=40A332574
- Triangle read by rows. Number T(n, k) of partitions of the multiset [1, 1, 1, 1, 2, 2, 2, 2, ..., n, n, n, n] into k nonempty subsets, for 4 <= k <= 4n.at n=31A360038
- a(n) is the first positive number that has exactly n anagrams which have 3 prime divisors, counted by multiplicity, or 0 if there is no such number.at n=34A369184