12143
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 12144
- 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
- 12142
- Möbius Function
- -1
- Radical
- 12143
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 112
- 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
- 1453
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Fifth term of weak prime quintets: p(m-3)-p(m-4) < p(m-2)-p(m-3) < p(m-1)-p(m-2) < p(m)-p(m-1).at n=26A054827
- Primes p such that p^12 reversed is also prime.at n=33A059705
- Primes with 10 as smallest positive primitive root.at n=35A061323
- Primes p such that p^2+p-1 and p^2+p+1 are twin primes.at n=33A088483
- Smallest number that can be written in binary representation as concatenation of other primes in exactly n ways.at n=36A090424
- Least initial value for a Euclid/Mullin sequence whose 3rd term (= least prime divisor of 1+2p) equals the n-th prime. prime(1)=2 is never a third term, so offset=2.at n=33A094464
- a(n) = floor(9^n/5^n).at n=16A094986
- Primes p such that index of p, the sum of p's digits and the number of p's digits are all primes.at n=33A109982
- Primes of the form k^3 - k - 1.at n=11A116581
- Primes and their indices such that when their respective SOD's are both prime, the SOD of the index is the nextprime of the prime SOD.at n=15A117458
- a(1) = 2. a(n) = a(n-1)*(largest prime occurring earlier in the sequence) - 1.at n=5A120763
- a(n) = n^3 - n - 1.at n=22A126420
- Primes p such that p - q = 24, where q is the previous prime before p; or prime numbers preceded by precisely 23 composite numbers.at n=19A126720
- Ramanujan numbers (A000594) read mod 23^3.at n=1A126847
- Prime numbers that are the sum of consecutive prime numbers with the final digit 1 (primes in A030430).at n=6A129077
- Primes congruent to 7 mod 41.at n=36A142204
- Primes congruent to 17 mod 43.at n=36A142266
- Primes congruent to 17 mod 47.at n=33A142368
- Primes congruent to 40 mod 49.at n=34A142448
- Primes congruent to 5 mod 51.at n=40A142479