8557
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
- 4
- Divisor Sum
- 8800
- Proper Divisor Sum (Aliquot Sum)
- 243
- 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
- 8316
- Möbius Function
- 1
- Radical
- 8557
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 78
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of n-node rooted trees of height 5.at n=13A000342
- a(n) = round(n*phi^11), where phi is the golden ratio, A001622.at n=43A004946
- Strong pseudoprimes to base 92.at n=20A020318
- Strong pseudoprimes to base 93.at n=12A020319
- Number of Dyck n-paths with ascents and descents of length equal to 1 (mod 3).at n=17A023432
- [ exp(9/17)*n! ].at n=6A030891
- "AFK" (ordered, size, unlabeled) transform of 2,1,1,1,...at n=23A032006
- A006318(n) - 1.at n=7A035011
- Number of partitions of n with equal number of parts congruent to each of 0 and 3 (mod 5).at n=40A035554
- Number of partitions satisfying (cn(0,5) = 0 and cn(1,5) <= cn(2,5) and cn(1,5) <= cn(3,5) and cn(4,5) <= cn(2,5) and cn(4,5) <= cn(3,5)).at n=48A036812
- Numbers k such that k^6 == 1 (mod 7^4).at n=22A056092
- a(n) = smallest k such that the digit sum of 7k is n.at n=38A077494
- a(n) = 16*n^2 + 4*n + 1.at n=23A082041
- Numbers k such that numerator(Bernoulli(2*k)/(2*k)) is different from numerator(Bernoulli(2*k)/(2*k*(2*k-1))).at n=31A090495
- Greatest multiple of the n-th prime in A098962.at n=13A099620
- Indices of primes in sequence defined by A(0) = 53, A(n) = 10*A(n-1) - 7 for n > 0.at n=15A101574
- Semiprimes in A103375.at n=16A103395
- Numbers n such that 2*prime(n) - prime(n+1) is a square.at n=40A110975
- a(0)=2, a(n) = n^2+a(n-1).at n=29A153056
- a(n) = Least i in range [A165583(n),A165583(n+1)] for which abs(A165582(i)) gets the maximum value in that range.at n=37A165584