10253
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 10254
- 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
- 10252
- Möbius Function
- -1
- Radical
- 10253
- 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
- 55
- 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
- 1257
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(1)=3, b(n) = Product_{k=1..n} a(k), a(n+1) is the smallest prime factor of b(n)-1.at n=21A005265
- Numbers k such that the continued fraction for sqrt(k) has period 67.at n=13A020406
- Pisot sequence L(5,8).at n=14A020736
- Primes that remain prime through 3 iterations of function f(x) = 10x + 3.at n=30A023300
- Numbers with exactly five distinct base-10 digits.at n=12A031987
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 23.at n=16A051964
- Expansion of (2-x-x^2-x^3)/((1-x)*(1-x^2-x^3)).at n=36A052954
- Differences between numbers k such that k and k+1 have the same sum of divisors.at n=18A054001
- a(0)=1, a(1)=1, a(n) = largest prime <= a(n-1) + a(n-2).at n=21A055500
- a(0)=1, a(1)=2, a(n) = largest prime < a(n-1)+a(n-2).at n=22A055501
- Essentially the same as A055500.at n=19A068523
- Five-digit distinct-digit primes.at n=2A074671
- Expansion of (1-x)^(-1)/(1-x^2+x^3).at n=38A077883
- a(1) = 2, a(2) = 3; for n >= 2, a(n+1) is smallest prime factor of (Product_{k = 1..n} a(k)) - 1.at n=21A084598
- Primes which when added to their own rotation yield a prime.at n=33A086002
- Primes p such that p-3 and p+3 are divisible by a cube.at n=10A089201
- p(k) such that 2*p(k)+3 and 2*p(k+1) + 3 are consecutive primes, where p(i) denotes the i-th prime.at n=40A089527
- Partial sums of A014531.at n=8A097894
- a(n)=the sum of the (1,2)- and (1,3)-entries of the matrix P^n + T^n, where the 3 X 3 matrices P and T are defined by P=[0,1,0;0,0,1;1,0,0] and T=[0,1,0;0,0,1;1,1,0].at n=35A109524
- Smaller of two consecutive Sophie Germain primes with the same digital sum.at n=25A118506