Base | Representation |
---|---|
bin | 11101000110110000100… |
… | …00000100101111011111 |
3 | 10112121022221021101211000 |
4 | 32203120100010233133 |
5 | 112341110442130210 |
6 | 2043231011201343 |
7 | 132152301015423 |
oct | 16433020045737 |
9 | 3477287241730 |
10 | 1000060505055 |
11 | 35613a0a1277 |
12 | 14199a2a6253 |
13 | 733c7991651 |
14 | 365904b6b83 |
15 | 1b031c18ac0 |
hex | e8d8404bdf |
1000060505055 has 16 divisors (see below), whose sum is σ = 1777885342560. Its totient is φ = 533365602624.
The previous prime is 1000060505033. The next prime is 1000060505111. The reversal of 1000060505055 is 5505050600001.
1000060505055 is a `hidden beast` number, since 1 + 0 + 0 + 0 + 0 + 605 + 0 + 5 + 0 + 55 = 666.
1000060505055 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1000060505055 - 210 = 1000060504031 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3703927662 + ... + 3703927931.
It is an arithmetic number, because the mean of its divisors is an integer number (111117833910).
Almost surely, 21000060505055 is an apocalyptic number.
1000060505055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1000060505055 is a deficient number, since it is larger than the sum of its proper divisors (777824837505).
1000060505055 is an equidigital number, since it uses as much as digits as its factorization.
1000060505055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7407855607 (or 7407855601 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 27.
The spelling of 1000060505055 in words is "one trillion, sixty million, five hundred five thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •