Base | Representation |
---|---|
bin | 101110100111011001… |
… | …1001110110001011111 |
3 | 100120101120122222010200 |
4 | 1131032303032301133 |
5 | 3120004203104021 |
6 | 113553241234543 |
7 | 10142504341350 |
oct | 1351663166137 |
9 | 316346588120 |
10 | 100106300511 |
11 | 39500440268 |
12 | 17499492a53 |
13 | 959484ac59 |
14 | 4bb9211d27 |
15 | 290d736126 |
hex | 174eccec5f |
100106300511 has 12 divisors (see below), whose sum is σ = 165254845392. Its totient is φ = 57203600256.
The previous prime is 100106300479. The next prime is 100106300533. The reversal of 100106300511 is 115003601001.
100106300511 is a `hidden beast` number, since 10 + 0 + 10 + 630 + 0 + 5 + 11 = 666.
It is not a de Polignac number, because 100106300511 - 25 = 100106300479 is a prime.
It is a super-2 number, since 2×1001063005112 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100106300111) 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 11 ways as a sum of consecutive naturals, for example, 794494386 + ... + 794494511.
It is an arithmetic number, because the mean of its divisors is an integer number (13771237116).
Almost surely, 2100106300511 is an apocalyptic number.
100106300511 is a deficient number, since it is larger than the sum of its proper divisors (65148544881).
100106300511 is a wasteful number, since it uses less digits than its factorization.
100106300511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1588988910 (or 1588988907 counting only the distinct ones).
The product of its (nonzero) digits is 90, while the sum is 18.
Adding to 100106300511 its reverse (115003601001), we get a palindrome (215109901512).
The spelling of 100106300511 in words is "one hundred billion, one hundred six million, three hundred thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •