Base | Representation |
---|---|
bin | 101110100111100000… |
… | …1011101010100011111 |
3 | 100120101211200110012000 |
4 | 1131033001131110133 |
5 | 3120011131430421 |
6 | 113553453213343 |
7 | 10142551134000 |
oct | 1351701352437 |
9 | 316354613160 |
10 | 100110030111 |
11 | 39502558383 |
12 | 1749a791253 |
13 | 9595555710 |
14 | 4bb99031a7 |
15 | 290dc21226 |
hex | 174f05d51f |
100110030111 has 128 divisors (see below), whose sum is σ = 188375040000. Its totient is φ = 52206384384.
The previous prime is 100110030101. The next prime is 100110030121. The reversal of 100110030111 is 111030011001.
It is an interprime number because it is at equal distance from previous prime (100110030101) and next prime (100110030121).
It is not a de Polignac number, because 100110030111 - 27 = 100110029983 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 100110030093 and 100110030102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100110030101) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 10710306 + ... + 10719648.
It is an arithmetic number, because the mean of its divisors is an integer number (1471680000).
Almost surely, 2100110030111 is an apocalyptic number.
100110030111 is a deficient number, since it is larger than the sum of its proper divisors (88265009889).
100110030111 is an equidigital number, since it uses as much as digits as its factorization.
100110030111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9475 (or 9455 counting only the distinct ones).
The product of its (nonzero) digits is 3, while the sum is 9.
Adding to 100110030111 its reverse (111030011001), we get a palindrome (211140041112).
The spelling of 100110030111 in words is "one hundred billion, one hundred ten million, thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •