Base | Representation |
---|---|
bin | 110011101111010101… |
… | …100000100000001101 |
3 | 12022101201112102111221 |
4 | 303233111200200031 |
5 | 1402234040002313 |
6 | 41304400243341 |
7 | 4004463466000 |
oct | 635725404015 |
9 | 168351472457 |
10 | 55555000333 |
11 | 21619393018 |
12 | a925310551 |
13 | 531489ca81 |
14 | 29903c3537 |
15 | 16a23cac8d |
hex | cef56080d |
55555000333 has 16 divisors (see below), whose sum is σ = 64812188800. Its totient is φ = 47600185248.
The previous prime is 55555000327. The next prime is 55555000357. The reversal of 55555000333 is 33300055555.
It is not a de Polignac number, because 55555000333 - 225 = 55521445901 is a prime.
It is a super-2 number, since 2×555550003332 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a zygodrome in base 10.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55555000363) 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 15 ways as a sum of consecutive naturals, for example, 898585 + ... + 958417.
It is an arithmetic number, because the mean of its divisors is an integer number (4050761800).
Almost surely, 255555000333 is an apocalyptic number.
It is an amenable number.
55555000333 is a deficient number, since it is larger than the sum of its proper divisors (9257188467).
55555000333 is an equidigital number, since it uses as much as digits as its factorization.
55555000333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62561 (or 62547 counting only the distinct ones).
The product of its (nonzero) digits is 84375, while the sum is 34.
Adding to 55555000333 its reverse (33300055555), we get a palindrome (88855055888).
The spelling of 55555000333 in words is "fifty-five billion, five hundred fifty-five million, three hundred thirty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •