Base | Representation |
---|---|
bin | 10110110111010001101000… |
… | …111101100100101101001111 |
3 | 111012001000102011000001212210 |
4 | 112313101220331210231033 |
5 | 101140000214014234201 |
6 | 553510324124201503 |
7 | 30115616622262464 |
oct | 2667215075445517 |
9 | 435030364001783 |
10 | 100555535305551 |
11 | 2a0493aa225707 |
12 | b340405399293 |
13 | 4415466a59261 |
14 | 1ab8cb196d66b |
15 | b95a30bdd1d6 |
hex | 5b7468f64b4f |
100555535305551 has 16 divisors (see below), whose sum is σ = 141182253338240. Its totient is φ = 63485504278560.
The previous prime is 100555535305543. The next prime is 100555535305567. The reversal of 100555535305551 is 155503535555001.
It is not a de Polignac number, because 100555535305551 - 23 = 100555535305543 is a prime.
It is a super-2 number, since 2×1005555353055512 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 100555535305551.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100555535305501) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 322827160 + ... + 323138493.
It is an arithmetic number, because the mean of its divisors is an integer number (8823890833640).
Almost surely, 2100555535305551 is an apocalyptic number.
100555535305551 is a deficient number, since it is larger than the sum of its proper divisors (40626718032689).
100555535305551 is a wasteful number, since it uses less digits than its factorization.
100555535305551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 645968406.
The product of its (nonzero) digits is 3515625, while the sum is 48.
The spelling of 100555535305551 in words is "one hundred trillion, five hundred fifty-five billion, five hundred thirty-five million, three hundred five thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •