Base | Representation |
---|---|
bin | 10110110111001101000000… |
… | …001001010110100001000001 |
3 | 111012000112120002201210012102 |
4 | 112313031000021112201001 |
5 | 101134410014210410001 |
6 | 553504142035040145 |
7 | 30115352334164051 |
oct | 2667150011264101 |
9 | 435015502653172 |
10 | 100550555560001 |
11 | 2a0472842a2118 |
12 | b33b455740055 |
13 | 4414b5216c861 |
14 | 1ab895c461561 |
15 | b9583d937e6b |
hex | 5b7340256841 |
100550555560001 has 16 divisors (see below), whose sum is σ = 107132670779904. Its totient is φ = 94044100879104.
The previous prime is 100550555559941. The next prime is 100550555560057. The reversal of 100550555560001 is 100065555055001.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 100550555560001 - 234 = 100533375690817 is a prime.
It is a super-2 number, since 2×1005505555600012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (100550555560201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21421166 + ... + 25689831.
It is an arithmetic number, because the mean of its divisors is an integer number (6695791923744).
Almost surely, 2100550555560001 is an apocalyptic number.
It is an amenable number.
100550555560001 is a deficient number, since it is larger than the sum of its proper divisors (6582115219903).
100550555560001 is a wasteful number, since it uses less digits than its factorization.
100550555560001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47111800.
The product of its (nonzero) digits is 93750, while the sum is 38.
The spelling of 100550555560001 in words is "one hundred trillion, five hundred fifty billion, five hundred fifty-five million, five hundred sixty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •