12301
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 12302
- 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
- 12300
- Möbius Function
- -1
- Radical
- 12301
- 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
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1471
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = smallest number k such that Product_{i=1..k} prime(i)/(prime(i)-1) > n.at n=21A005579
- Numbers k such that the continued fraction for sqrt(k) has period 37.at n=28A020376
- Palindromic primes in base 3.at n=21A029971
- Base-3 digits are, in order, the first n terms of the periodic sequence with initial period 1,2.at n=8A037480
- Decimal expansion of a(n) is given by the first n terms of the periodic sequence with initial period 1,2,3,0.at n=4A037701
- Numbers whose maximal base-9 run length is 4.at n=22A037999
- Numbers having four 7's in base 9.at n=1A043484
- Primes prime(k) for which A049076(k) = 3.at n=35A049079
- 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=27A054826
- Primes p whose period of reciprocal equals (p-1)/5.at n=25A056210
- Primes p such that x^41 = 2 has no solution mod p.at n=36A059236
- Primes p such that q-p = 22, where q is the next prime after p.at n=23A061779
- Primes whose sum of digits is 7.at n=38A062337
- Primes of form 100*k + 1.at n=36A062800
- Centered 15-gonal numbers: a(n) = (15*n^2 - 15*n + 2)/2.at n=40A069128
- Primes of the form 2^i*3^j + (i+j) with i, j >= 0.at n=11A069358
- Numbers k such that k, sigma(k) and phi(k) have the same decimal digits (ignoring multiplicity).at n=14A082059
- a(n) = prime(prime(Fibonacci(n))).at n=12A093309
- A variation on Flavius's sieve (A000960): Start with the primes; at the k-th sieving step, remove every (k+1)-st term of the sequence remaining after the (k-1)-st sieving step; iterate.at n=42A099207
- a(n) = (n^3 - 7*n + 12)/6.at n=41A105163