12227
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
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 12228
- 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
- 12226
- Möbius Function
- -1
- Radical
- 12227
- 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
- 156
- 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
- yes
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1461
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p such that the decimal digits of p^2 can be partitioned into two or more nonzero squares.at n=30A048646
- Primes with either no internal digits or all internal digits are 2.at n=51A069677
- Highly Wilsonian primes: smallest primes p such that w(p)=n where w(n) denote the number of nonnegative integers k such that k! = +1 or -1 (mod n).at n=13A071710
- Primes of the form ceiling(n^Pi).at n=1A074220
- Safe primes (A005385) (p and (p-1)/2 are primes) such that 6*p+1 is also prime.at n=38A075705
- Smallest prime in which the digit string can be partitioned into n+1 parts (only nonzero parts allowed) such that the sum of the first n parts = the (n+1)th one.at n=3A088293
- a(n) = A000040(A096480(n)).at n=19A096481
- Beginning with 3, least prime such that concatenation of first n terms and its digit reversal both are primes.at n=17A113584
- Least K such that K*p(n)#-1 is the first of twin primes and 2*(K*p(n)#-1)+1 is prime, so K*p(n)#-1 is the first of twin primes and a Sophie Germain prime.at n=42A117848
- Numbers k such that p(k+1)# - p(k)# - p(k-1)# - 1 is prime, where p(i)# = product of first i primes = A002110(i).at n=20A128659
- Primes of the form 210k + 47.at n=30A140850
- Primes congruent to 17 mod 37.at n=39A142126
- Primes congruent to 15 mod 43.at n=31A142264
- Primes congruent to 7 mod 47.at n=32A142358
- Primes congruent to 26 mod 49.at n=37A142436
- Primes congruent to 37 mod 53.at n=25A142567
- Primes congruent to 17 mod 55.at n=40A142613
- Primes congruent to 14 mod 59.at n=27A142741
- Primes congruent to 27 mod 61.at n=22A142825
- Primes congruent to 5 mod 63.at n=42A142892