Base | Representation |
---|---|
bin | 10000000000100011101… |
… | …01010100110101110011 |
3 | 1221120210021112110022011 |
4 | 20000101311110311303 |
5 | 33003003040134210 |
6 | 1100405231423351 |
7 | 54511606255216 |
oct | 10002165246563 |
9 | 1846707473264 |
10 | 550055005555 |
11 | 1a230578aa90 |
12 | 8a730384b57 |
13 | 3cb40409363 |
14 | 1c8a0d9177d |
15 | e495240d8a |
hex | 8011d54d73 |
550055005555 has 32 divisors (see below), whose sum is σ = 724392875520. Its totient is φ = 397646695680.
The previous prime is 550055005541. The next prime is 550055005559. The reversal of 550055005555 is 555500550055.
It is not a de Polignac number, because 550055005555 - 25 = 550055005523 is a prime.
It is a super-2 number, since 2×5500550055552 (a number of 24 digits) contains 22 as substring.
It is a zygodrome in base 10.
It is not an unprimeable number, because it can be changed into a prime (550055005559) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6135684 + ... + 6224686.
It is an arithmetic number, because the mean of its divisors is an integer number (22637277360).
Almost surely, 2550055005555 is an apocalyptic number.
550055005555 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
550055005555 is a deficient number, since it is larger than the sum of its proper divisors (174337869965).
550055005555 is a wasteful number, since it uses less digits than its factorization.
550055005555 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89691.
The product of its (nonzero) digits is 390625, while the sum is 40.
It can be divided in two parts, 55005500 and 5555, that added together give a palindrome (55011055).
The spelling of 550055005555 in words is "five hundred fifty billion, fifty-five million, five thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •