Base | Representation |
---|---|
bin | 10110110000000000000110… |
… | …011110000010110000010011 |
3 | 111010021020011102222012000011 |
4 | 112300000012132002300103 |
5 | 101103303001131312030 |
6 | 552444534432335351 |
7 | 30034532460042520 |
oct | 2660000636026023 |
9 | 433236142865004 |
10 | 100055666666515 |
11 | 2997640842969a |
12 | b27b5603a4557 |
13 | 43aa293bb2581 |
14 | 1a9ca11d82147 |
15 | b87a268a6b2a |
hex | 5b0006782c13 |
100055666666515 has 64 divisors (see below), whose sum is σ = 144653877319680. Its totient is φ = 64953912038400.
The previous prime is 100055666666503. The next prime is 100055666666519. The reversal of 100055666666515 is 515666666550001.
It is not a de Polignac number, because 100055666666515 - 221 = 100055664569363 is a prime.
It is a super-2 number, since 2×1000556666665152 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 100055666666515.
It is not an unprimeable number, because it can be changed into a prime (100055666666519) 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 63 ways as a sum of consecutive naturals, for example, 232073016 + ... + 232503754.
It is an arithmetic number, because the mean of its divisors is an integer number (2260216833120).
Almost surely, 2100055666666515 is an apocalyptic number.
100055666666515 is a deficient number, since it is larger than the sum of its proper divisors (44598210653165).
100055666666515 is a wasteful number, since it uses less digits than its factorization.
100055666666515 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 433732.
The product of its (nonzero) digits is 29160000, while the sum is 58.
The spelling of 100055666666515 in words is "one hundred trillion, fifty-five billion, six hundred sixty-six million, six hundred sixty-six thousand, five hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •