12119
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
- 12120
- 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
- 12118
- Möbius Function
- -1
- Radical
- 12119
- 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
- 143
- 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
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1452
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes that remain prime through 3 iterations of the function f(x) = 2*x + 1.at n=14A023272
- a(n) = [ 2nd elementary symmetric function of {sqrt(k+1)} ], k = 1,2,...,n.at n=35A025219
- Last member of a sexy prime quadruple: value of p+18 such that p, p+6, p+12 and p+18 are all prime.at n=25A046124
- Fourth term of weak prime quintets: p(m-2)-p(m-3) < p(m-1)-p(m-2) < p(m)-p(m-1) < p(m+1)-p(m).at n=26A054826
- Primes starting a Cunningham chain of the first kind of length 4.at n=9A059763
- Primes for which the four closest primes are smaller.at n=24A075030
- Primes for which the five closest primes are smaller.at n=3A075037
- Cycle of the inventory sequence (as in A063850) starting with n consists of prime numbers.at n=41A078970
- Primes p such that q-p = 24, where q is the next prime after p.at n=19A098974
- Primes of the form 4*k-1 such that 8*k-1 and 16*k-1 are also primes.at n=23A101791
- Primes of the form 4*k-1 such that 8*k-1, 16*k-1 and 32*k-1 are also primes.at n=4A101795
- Primes p such that 2p+1, 4p+3, 6p+5 are all primes.at n=12A107020
- Primes p such that 2p+1, 4p+3, 6p+5, 8p+7 are all primes.at n=2A107021
- prime(k) for those k where floor((2*(prime(k+1)-prime(k))*PrimePi(k) mod (8*k))/k) = m with m = 7.at n=29A109561
- Smallest primes starting a complete three iterations Cunningham chain of the first or second kind.at n=14A110025
- Smallest prime p such that p == 1 (mod prime(n)) and not p == 1 (mod k) for 2 < k < prime(n).at n=20A116605
- Sophie Germain primes for which the reversal is also a Sophie Germain prime.at n=15A118573
- a(n) is the least prime factor of (9 * 10^(6*n-4) - 11) / 7.at n=24A122691
- Describe prime factorization of n (primes in ascending order and with repetition) (method A - initial term is 2).at n=36A123132
- Numbers n such that (2^n + 11^n)/13 is prime.at n=8A125957