5569
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 5570
- 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
- 5568
- Möbius Function
- -1
- Radical
- 5569
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 129
- 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
- 735
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- 11*n^2 + 11*n + 3.at n=22A006222
- Primes p == 1 (mod 8), p = a^2 +64*b^2 such that y^2 = x^3 + p*x has rank 0.at n=26A007765
- Primes that remain prime through 3 iterations of function f(x) = 4x + 3.at n=17A023281
- Numbers whose least quadratic nonresidue (A020649) is 13.at n=16A025025
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 52 ones.at n=7A031820
- Primes p such that p+4 and p+12 are also prime.at n=39A046137
- First term of weak prime quintets: p(m+1)-p(m) < p(m+2)-p(m+1) < p(m+3)-p(m+2) < p(m+4)-p(m+3).at n=13A054823
- Numbers k such that x^k + x^4 + 1 is irreducible over GF(2).at n=10A057463
- McKay-Thompson series of class 38a for Monster.at n=39A058658
- Primes p such that x^29 = 2 has no solution mod p.at n=22A059256
- Primes p such that x^24 = 2 has no solution mod p, but x^12 = 2 has a solution mod p.at n=31A059331
- Primes p such that x^56 = 2 has no solution mod p, but x^28 = 2 has a solution mod p.at n=37A059635
- Primes with 13 as smallest positive primitive root.at n=13A061326
- Primes p such that p + 4 is prime and p == 9 (mod 10).at n=39A074822
- Primes of the form perfect_power(n)+n.at n=15A075781
- Numbers k such that (31*10^(k-1) - 13)/9 is a plateau prime.at n=3A082706
- Primes p such that for some k the number of terms > 0 and < 1 in the Farey sequence of order k is p.at n=45A085918
- Primes such that successive differences are distinct palindromes.at n=24A087582
- Primes where the difference sequence (A088197) of LQnR(p_n) (A088196) is <= 0.at n=37A088199
- Numbers n with following property: suppose n^2 = d1 d2 d3 ...dk in decimal; then d1! + d2! + ... + dk! is a square.at n=41A089185