10531
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
- 10532
- 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
- 10530
- Möbius Function
- -1
- Radical
- 10531
- 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
- 1288
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes that remain prime through 3 iterations of function f(x) = 9x + 2.at n=28A023296
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 80 ones.at n=1A031848
- Numerators of continued fraction convergents to sqrt(880).at n=6A042700
- Numerators of continued fraction convergents to sqrt(890).at n=4A042720
- Primes base 10 that remain primes in six bases b, 2<=b<=10, expansions interpreted as decimal numbers.at n=7A052028
- a(1) = 2; a(n) is the smallest prime > a(n-1) such that a(n) + a(n-1) is a square.at n=15A062064
- Primes of the form perfect_power(n)+n.at n=18A075781
- Primes p such that (r-p)/log(p) > 3, where r is the next prime after p.at n=29A082888
- Least initial value for an Euclid/Mullin sequence whose 4th term is prime(n). prime(1)=2 is never a fourth term, so offset=2.at n=39A094465
- Primes of the form 47*k + 3.at n=31A100494
- prime(k) for those k where floor((2*(prime(k+1)-prime(k))*PrimePi(k) mod (8*k))/k) = m with m = 9.at n=11A109563
- Primes p such that q-p = 28, where q is the next prime after p.at n=7A124595
- Primes p such that p*q-p-q and p*q+p+q are prime where q=nextprime(p).at n=25A128548
- a(n) is n-th prime == 1 (mod 6n).at n=26A138906
- Primes of the form 10x^2+10xy+139y^2.at n=37A140019
- Primes of the form 19x^2+14xy+91y^2.at n=38A140624
- Primes of the form 210k + 31.at n=27A140846
- Primes congruent to 22 mod 31.at n=42A142026
- Primes congruent to 23 mod 37.at n=35A142132
- Primes congruent to 35 mod 41.at n=28A142232