Base | Representation |
---|---|
bin | 101000000001011001010… |
… | …1010000001110000001011 |
3 | 201110211220011121012011100 |
4 | 1100002302222001300023 |
5 | 1210110114202004210 |
6 | 15410530442032443 |
7 | 1105254615212613 |
oct | 120026252016013 |
9 | 21424804535140 |
10 | 5500555500555 |
11 | 18308551a9825 |
12 | 74a064aa8723 |
13 | 30b91432a09b |
14 | 15032a68ba43 |
15 | 98136ed25c0 |
hex | 500b2a81c0b |
5500555500555 has 24 divisors (see below), whose sum is σ = 9546891103152. Its totient is φ = 2929754245824.
The previous prime is 5500555500553. The next prime is 5500555500569. The reversal of 5500555500555 is 5550055550055.
It is not a de Polignac number, because 5500555500555 - 21 = 5500555500553 is a prime.
It is a super-2 number, since 2×55005555005552 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a zygodrome in base 10.
It is a self number, because there is not a number n which added to its sum of digits gives 5500555500555.
It is not an unprimeable number, because it can be changed into a prime (5500555500553) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 80702109 + ... + 80770238.
It is an arithmetic number, because the mean of its divisors is an integer number (397787129298).
Almost surely, 25500555500555 is an apocalyptic number.
5500555500555 is a deficient number, since it is larger than the sum of its proper divisors (4046335602597).
5500555500555 is a wasteful number, since it uses less digits than its factorization.
5500555500555 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161473115 (or 161473112 counting only the distinct ones).
The product of its (nonzero) digits is 1953125, while the sum is 45.
The spelling of 5500555500555 in words is "five trillion, five hundred billion, five hundred fifty-five million, five hundred thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •