12854
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 19284
- Proper Divisor Sum (Aliquot Sum)
- 6430
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6426
- Möbius Function
- 1
- Radical
- 12854
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 76
- 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
- yes
- Odd
- no
Appears in sequences
- Number of partitions satisfying (cn(2,5) = cn(3,5) and cn(0,5) <= cn(1,5) and cn(0,5) <= cn(4,5)).at n=48A036805
- T(n, k) = S(2n, n, k) for 0<=k<=n and n>=0, where S(p, q, r) is the number of upright paths from (0, 0) to (p, p-q) that do not rise above the line y = x-r.at n=42A050157
- First subsequent, disjoint occurrence of n consecutive nonprimes.at n=33A060064
- Binomial transform of A000960.at n=9A099063
- 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=33A120424
- a(n) = 4*n^3 - 3*n^2 + 2*n - 1.at n=14A131464
- a(n) = Sum_{j = 1..n} Sum_{i = 1..n} (i + j)! / (i! * j!).at n=7A144657
- Numbers k such that 2^k + 27 is prime.at n=34A157007
- Potential magic constants of a 10 X 10 magic square composed of consecutive primes.at n=17A192087
- a(n) = Sum_{k=0..floor(n/2)} (C(n+2, k+2) - C(n+2, k)).at n=13A194124
- Numbers k whose decimal expansion can be split into at least two parts whose binary equivalents can be concatenated (in the same order) to form the binary expansion of the original number k.at n=34A237041
- Lower ends of record gaps between numbers that are either prime or twice a prime.at n=12A290488
- Least number that is the start of a gap of size n between numbers that are either prime or twice a prime (A001751).at n=34A290572
- Sum of the third largest parts of the partitions of n into 10 squarefree parts.at n=49A326635
- Expansion of e.g.f. exp(1 - sec(x)) (even powers only).at n=5A331818
- Number of partitions of 2*n into exactly n squarefree parts.at n=46A341153