10069
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 10070
- 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
- 10068
- Möbius Function
- -1
- Radical
- 10069
- 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
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1236
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes that yield a different prime when rotated by 180 degrees.at n=29A048890
- Numbers k such that prime(k+3)-(k+3)*tau(k+3) = prime(k-3)-(k-3)*tau(k-3) where tau(k) = A000005(k) is the number of divisors of k.at n=25A067355
- Suppose the integer m has k decimal digits; make a list of the k! strings obtained by permuting the digits in all possible ways; discard any leading zeros; count distinct squares in the list (A062892); a(n) = smallest m that yields n squares.at n=8A068805
- Primes that are still primes when turned upsided down.at n=33A080788
- a(1) = 1; for n>1, a(n) = smallest prime > a(n-1) such that a(1)*...*a(n) + 2 is a prime.at n=48A085013
- a(n) is the smallest integer k for which sigma_n(k) <= sigma_n(k-1) where sigma_n(k) = sum of the n-th powers of the divisors of k.at n=10A098475
- Numbers n such that 2*10^n + 7*R_n - 4 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=9A102958
- a(1)=1. a(n) = a(n-1) + (sum of terms, from among terms a(1) through a(n-1), which are prime or 1).at n=18A104589
- Prime sums of 6 positive 5th powers.at n=20A123035
- Primes that are the arithmetic mean of four successive primes.at n=42A126096
- Primes of the form 64k+21.at n=39A127592
- Primes of the form 256 k + 85.at n=10A127593
- Number of non-isomorphic maximal independent sets of the n-cycle graph.at n=48A127685
- Emirps with only nonprime digits (i.e., 0, 1, 4, 6, 8, 9).at n=28A128390
- Primes p of Erdos-Selfridge class 3+ with largest prime factor of p+1 not of class 2+.at n=33A129471
- Primes of the form 21x^2+40y^2.at n=40A139993
- Primes of the form 6x^2+6xy+229y^2.at n=38A140017
- Primes congruent to 6 mod 29.at n=41A141982
- Primes congruent to 25 mod 31.at n=39A142029
- Primes congruent to 5 mod 37.at n=34A142114