Base | Representation |
---|---|
bin | 10110110000101110100000… |
… | …110011000011010110100111 |
3 | 111010102222210110010111120202 |
4 | 112300232200303003112213 |
5 | 101110112031112134021 |
6 | 552523455420421115 |
7 | 30041245423506044 |
oct | 2660564063032647 |
9 | 433388713114522 |
10 | 100105500505511 |
11 | 299955603214a6 |
12 | b2891496a779b |
13 | 43b1ba63b5477 |
14 | 1aa11bc5bc1cb |
15 | b88e91878a0b |
hex | 5b0ba0cc35a7 |
100105500505511 has 16 divisors (see below), whose sum is σ = 106890422791680. Its totient is φ = 93523422965280.
The previous prime is 100105500505501. The next prime is 100105500505643. The reversal of 100105500505511 is 115505005501001.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 100105500505511 - 230 = 100104426763687 is a prime.
It is a super-2 number, since 2×1001055005055112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100105500505501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 31301105 + ... + 34350693.
It is an arithmetic number, because the mean of its divisors is an integer number (6680651424480).
Almost surely, 2100105500505511 is an apocalyptic number.
100105500505511 is a deficient number, since it is larger than the sum of its proper divisors (6784922286169).
100105500505511 is a wasteful number, since it uses less digits than its factorization.
100105500505511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3082846.
The product of its (nonzero) digits is 3125, while the sum is 29.
The spelling of 100105500505511 in words is "one hundred trillion, one hundred five billion, five hundred million, five hundred five thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •