5503
domain: N
Properties
Digital Properties
- Digit Count
- 4
- 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
- 5504
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5502
- Möbius Function
- -1
- Radical
- 5503
- 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
- 173
- 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
- 727
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Related to population of numbers of form x^2 + y^2.at n=14A000693
- Primes p such that the multiplicative order of 2 modulo p is (p-1)/6.at n=37A001136
- a(1) = 0, a(2) = 0; for n > 2, a(n) - a(n-3) - a(n-5) - ... - a(n-p) = n if n is prime, otherwise = 0, where p = largest prime < n.at n=32A002123
- Largest prime == 7 (mod 8) with class number 2n+1.at n=12A002147
- Where the prime race among 5k+1, ..., 5k+4 changes leader.at n=27A007353
- Coordination sequence T1 for Zeolite Code MFI.at n=47A008161
- Coordination sequence T3 for Zeolite Code MFI.at n=47A008166
- Fibonacci sequence beginning 1, 23.at n=13A022393
- Primes that remain prime through 2 iterations of the function f(x) = 8*x + 5.at n=39A023262
- Odd numbers congruent to 7 mod 8 such that (2^(h(-n)+2)-n) is a square, where h(-n) is the class number.at n=47A029724
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 73.at n=16A031571
- Riesel problem: Smallest prime of form n*2^m-1, m >= 0, or 0 if no such prime exists.at n=42A038699
- Number of partitions satisfying cn(0,5) < cn(1,5) + cn(4,5) + cn(2,5) + cn(3,5).at n=29A039848
- Numbers whose base-4 representation contains exactly four 1's and three 3's.at n=0A045132
- Primes p such that p+4 and p+16 are also primes.at n=41A049492
- a(n) = Sum{a(k): k=0,1,2,...,n-4,n-2,n-1}; a(n-3) is not a summand; initial terms are 1,3,3.at n=14A049871
- A Diaconis-Mosteller approximation to the Birthday problem function.at n=27A050255
- Riesel problem: start with n; repeatedly double and add 1 until reach a prime. Sequence gives a(n) = prime reached, or 0 if no prime is ever reached.at n=41A052333
- Record primes reached in A052333.at n=10A052334
- Difference between 2^n and largest square strictly less than 2^n.at n=27A056007