12601
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 12602
- 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
- 12600
- Möbius Function
- -1
- Radical
- 12601
- 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
- 1505
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = Sum_{k=0..2n} (k+1) * A027023(n,2n-k).at n=8A027044
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 94 ones.at n=1A031862
- Primes p such that (p+1)/2 and (p+2)/3 are also primes.at n=29A036570
- Number of cubic residues mod 5^n.at n=6A046633
- McKay-Thompson series of class 39B for Monster.at n=46A058660
- Sum of orders of all even permutations of n letters.at n=6A060015
- Primes of form 100*k + 1.at n=38A062800
- Numbers k > 1 such that sigma(phi(k))/sigma(k) > sigma(phi(j))/sigma(j) for all 1 < j < k.at n=18A067573
- a(n) = Sum_{d|n} phi(d^3).at n=24A068963
- Centered 20-gonal (or icosagonal) numbers.at n=35A069133
- Primes of the form 210n + 1.at n=29A073102
- Primes on axis of Ulam square spiral (with rows ... / 7 8 9 / 6 1 2 / 5 4 3 / ... ) with origin at (1).at n=49A078784
- Partial sums of A080182.at n=16A080183
- Numbers k such that k, sigma(k) and phi(k) have the same decimal digits (ignoring multiplicity).at n=18A082059
- a(1) = 2, a(n+1) = smallest prime of the form a(n) + k*prime(n+1), k >1.at n=31A085041
- Smallest prime of the form 1 followed by a perfect power.at n=11A089773
- a(1) = 3; for n > 1 a(n) is the least prime of form a(n-1) + k*prime(n-1) with k > 0.at n=32A095184
- Primes of the form 47n+5.at n=34A100760
- Primes p such that p-1 has more divisors than any smaller prime-1.at n=18A103199
- a(n+3) = 2a(n+2) - 3a(n+1) + 2a(n); a(0) = 1, a(1) = 3, a(2) = 4.at n=27A105579