10453
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 10454
- 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
- 10452
- Möbius Function
- -1
- Radical
- 10453
- 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
- 29
- 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
- 1278
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 29.at n=1A031617
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 62 ones.at n=14A031830
- Upper prime of a difference of 20 between consecutive primes.at n=16A031939
- Numbers k such that 221*2^k+1 is prime.at n=31A032487
- Positive numbers having the same set of digits in base 9 and base 10.at n=34A037443
- Number of primes less than 10000n.at n=10A038813
- Primes at which the difference pattern X424Y (X and Y >= 6) occurs in A001223.at n=17A052166
- Primes followed by a [4,2,4] prime difference pattern of A001223.at n=25A052378
- Number of polyominoes with n cells that do not tile the plane.at n=10A054360
- Numbers k such that 3*10^k + 1 is prime.at n=14A056807
- Primes p such that x^67 = 2 has no solution mod p.at n=20A059330
- Numbers n such that the Eisenstein integer (1 - ω)^n - 1 has prime norm, where ω = -1/2 + sqrt(-3)/2.at n=21A066408
- Five-digit distinct-digit primes.at n=11A074671
- Primes which when added to their own rotation yield a prime.at n=41A086002
- Numbers of the form prime(prime(n)+1), with n satisfying prime(n)+2 = prime(n+1).at n=42A088985
- Prime(p)-4 for primes p such that prime(p) - 4 is prime.at n=27A094069
- Expansion of (7 +4*x -5*x^2 -7*x^3) / ((1-x)*(1-x^2-x^3)).at n=26A103485
- The i-th term of the generalized Fibonacci sequence [0,k,k,2k,3k,...] is given by the formula F(i) = round( k/sqrt(5) * phi^i ) provided i >= s(k); a(n) = smallest value of k such that s(k) = n.at n=18A111917
- a(n) = a(n-2) - (n-3)*a(n-3), with a(0)=0, a(1)=1, a(2)=2.at n=16A122044
- Primes p such that 3^p - 3^((p + 1)/2) + 1 is prime.at n=9A125738