12911
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 12912
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12910
- Möbius Function
- -1
- Radical
- 12911
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 169
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1537
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = Sum_{k=0..8} binomial(n,k).at n=14A008861
- Primes that remain prime through 2 iterations of function f(x) = 8x + 1.at n=31A023260
- Numbers whose least quadratic nonresidue (A020649) is 13.at n=36A025025
- Graham-Sloane-type lower bound on the size of a ternary (n,3,4) constant-weight code.at n=32A030504
- a(n) = 2^n - C(n,0) - C(n,1) - ... - C(n,5).at n=14A035038
- a()=A037260 and its first [ A037261 ], 2nd [ A037262 ] and 3rd [ A037263 ] differences together include every number at most once and are monotonic and minimal.at n=19A037260
- Number of partitions satisfying cn(1,5) + cn(4,5) < cn(0,5) + cn(2,5) + cn(3,5).at n=38A039868
- Primes with 23 as smallest positive primitive root.at n=4A061335
- Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d = 2, 4 or 6) and forming d-pattern=[6,2,4]; short d-string notation of pattern = [624].at n=5A078853
- Balanced primes of order four.at n=13A082079
- Primes that are a concatenation of a prime and its first digit.at n=39A085414
- Numbers m such that for increasing b the numbers of zeros in base b representation of m are monotonically decreasing, 1<b<m.at n=45A089969
- Riordan array (1/((1-2x)(1-x)^2), -x/(1-x)^2).at n=57A135552
- Numbers k such that k and k^2 use only the digits 1, 2, 3, 6 and 9.at n=23A136981
- Primes congruent to 37 mod 41.at n=37A142234
- Primes congruent to 11 mod 43.at n=39A142260
- Primes congruent to 33 mod 47.at n=34A142384
- Primes congruent to 24 mod 49.at n=38A142434
- Primes congruent to 32 mod 53.at n=25A142562
- Primes congruent to 41 mod 55.at n=40A142630