Properties of the Number 55505

Fifty-Five Thousand Five Hundred Five

Basics

Value: 55504 → 55505 → 55506

Parity: odd

Prime: No

Previous Prime: 55501

Next Prime: 55511

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 5 × 17 × 653

Divisors: 1, 5, 17, 85, 653, 3265, 11101, 55505

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101100011010001

Octal: 154321

Duodecimal: 28155

Hexadecimal: d8d1

Square: 3080805025

Square Root: 235.5949914577982

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

Smallest multiple of n using only digits 0 and 5. A78244

Numbers having four 5's in base 10. A43512

a(n) = 66·n² - 1. A158693

Digitally balanced numbers (A031443) whose squares and cubes are also digitally balanced. A353140

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

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

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

Numerators in expansion of (1-x)^-1/x/e. A55505