Properties of the Number 55550

Fifty-Five Thousand Five Hundred Fifty

Basics

Value: 55549 → 55550 → 55551

Parity: even

Prime: No

Previous Prime: 55547

Next Prime: 55579

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 × 5 ² × 11 × 101

Divisors: 1, 2, 5, 10, 11, 22, 25, 50, 55, 101

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1101100011111110

Octal: 154376

Duodecimal: 28192

Hexadecimal: d8fe

Square: 3085802500

Square Root: 235.69047498785352

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

Numbers whose decimal expansion contains only 0's and 5's. A169964

Numbers having four 5's in base 10. A43512

For k in {2,3,...,9} define a sequence as follows: a(0)=0; for n>=0, a(n+1)=a(n)+1, unless a(n) ends in k, in which case a(n+1) is obtained by replacing the last digit of a(n) with the digit(s) of k². This is k(7). A237344

Consider a decimal number of k>=2 digits x = d_k*10^k-1 + d_k-1*10^k-2 + ... + d₂*10 + d₁ and the transform T(x)-> (d_k+d_k-1 mod 10)*10^k-1 + (d_k-1+d_k-2 mod 10)*10^k-2 + ... + (d₂+d₁ mod 10)*10 + (d₁+d(k) mod 10). Sequence lists the numbers·such that T(x) divides x. A244286

a(n) = number of solutions to the Diophantine equation x+y²+z³=n⁴ with positive x,y,z all distinct. A121984

Numbers k such that k and k² use only the digits 0, 2, 3, 5 and 8. A136890

Numbers k such that the number of primes between k and 2k (inclusive) is equal to the number of primes between k and reverse(k) (inclusive). A74814

Numbers in which each digit equals the sum (mod 10) of the other digits. A226468

a(0) = a(1) = 1; for n > 1, a(n) = ∑_k=0..n-2 a(k) OR a(n-k-2). A318621

Consider a decimal number of k >= 2 digits m = d_k*10^k-1 + d_k-1*10^k-2 + ... + d₂*10 + d₁. a(n) is the least number m such that the n-th iteration of the transform T(m) -> (d_k + d_k-1 mod 10)*10^k-1 + (d_k-1 + d_k-2 mod 10)*10^k-2 + ... + (d₂ + d₁ mod 10)*10 + (d₁ + d(k) mod 10) returns m, or -1 if no such number exists. A243993