12401
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 12402
- 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
- 12400
- Möbius Function
- -1
- Radical
- 12401
- 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
- 125
- 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
- 1480
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Let A(n) = #{(i,j): i^2 + j^2 <= n}, V(n) = Pi*n, P(n) = A(n) - V(n); A000099 gives values of n where |P(n)| sets a new record; sequence gives A(A000099(n)).at n=30A000323
- Let A(n) = #{(i,j): i^2 + j^2 <= n}, V(n) = Pi*n, P(n) = A(n) - V(n); A000099 gives values of n where |P(n)| sets a new record; sequence gives A(A000099(n)).at n=29A000323
- Quartan primes: primes of the form x^4 + y^4, x > 0, y > 0.at n=15A002645
- Numbers k such that the continued fraction for sqrt(k) has period 39.at n=23A020378
- Primes that remain prime through 3 iterations of function f(x) = 4x + 9.at n=33A023282
- Primes followed by an [8,4,8]=[d,D-d,d] prime difference pattern of A001223.at n=6A052377
- Third term of strong prime 5-tuples: p(m-1)-p(m-2) > p(m)-p(m-1) > p(m+1)-p(m) > p(m+2)-p(m+1).at n=31A054810
- First occurrence of run of primes congruent to 1 mod 4 of exactly length n.at n=5A055623
- Primes p whose reciprocal has period (p-1)/10.at n=19A056215
- Primes p such that p^12 reversed is also prime.at n=34A059705
- Distinct (non-overlapping) twin Harshad numbers whose sum is prime.at n=40A060288
- Primes of form 100*k + 1.at n=37A062800
- Numbers k such that k, sigma(k) and phi(k) have the same decimal digits (ignoring multiplicity).at n=16A082059
- Integers m such that the base-10 digit concatenation 2//m//3//m//5//m...//prime(49)//m//prime(50) is prime.at n=29A084048
- Primes p of the form 2*prime(k) + 3 such that 2*prime(k+1) + 3 is the next prime after p.at n=28A089528
- Smallest prime of the form 1 followed by a perfect power.at n=10A089773
- Duplicate of A055623.at n=5A092567
- Prime numbers that are 2 less than a prime-indexed odd triangular number or 1 more than a prime-indexed even triangular number.at n=22A096333
- Primes of the form x^4 + y^4 with x^2 + y^2 and x+y also prime.at n=8A100268
- Chen primes p such that p + 2 is triangular.at n=10A109504