10061
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
- 10062
- 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
- 10060
- Möbius Function
- -1
- Radical
- 10061
- 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
- 42
- 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
- 1234
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p such that the multiplicative order of 2 modulo p is (p-1)/5.at n=25A001135
- Quadruples of different integers from [ 1,n ] with no global factor.at n=23A015622
- Numbers k such that the continued fraction for sqrt(k) has period 27.at n=40A020366
- Primes that remain prime through 3 iterations of function f(x) = 10x + 3.at n=29A023300
- Primes that remain prime through 4 iterations of function f(x) = 10x + 3.at n=1A023328
- Primes that remain prime through 5 iterations of the function f(x) = 10x + 3.at n=0A023356
- Number of compositions into sums of cubes.at n=48A023358
- Primes that yield a different prime when rotated by 180 degrees.at n=28A048890
- Bemirps: primes that yield a different prime when turned upside down with reversals of both being two more different primes.at n=4A048895
- Primes p from A031924 such that A052180(primepi(p)) = 29.at n=7A052236
- Primes associated with A052507.at n=41A052480
- Primes starting and ending with 1.at n=39A062332
- Primes whose sum of digits is 8.at n=30A062343
- Primes which can be expressed as concatenation of powers of 6 and 0's.at n=13A066597
- Lonely non-twin primes: non-twins sandwiched between two pairs of twins.at n=37A068016
- n-th n-digit prime number.at n=4A069100
- Triangle read by rows in which row n gives n smallest n-digit primes.at n=14A073914
- For n < 5, a(n) = n-th prime. For n >= 5, let m = n-th prime. If m is a k-digit prime then a(n) = smallest prime obtained by inserting at least one digit between every pair of digits of m. There are (k-1) places where digit insertion takes place and a(n) contains at least 2k-1 digits.at n=25A080437
- a(1) = 11, a(n) is the smallest prime obtained by inserting digits between every pair of digits of a(n-1).at n=2A080439
- Primes that are still primes when turned upsided down.at n=32A080788