Base | Representation |
---|---|
bin | 101110100111100000… |
… | …1110001000110000111 |
3 | 100120101211211120022000 |
4 | 1131033001301012013 |
5 | 3120011142023421 |
6 | 113553455040343 |
7 | 10142551622103 |
oct | 1351701610607 |
9 | 316354746260 |
10 | 100110111111 |
11 | 3950260321a |
12 | 1749a8100b3 |
13 | 959558354a |
14 | 4bb9924903 |
15 | 290dc3a226 |
hex | 174f071187 |
100110111111 has 16 divisors (see below), whose sum is σ = 150098161920. Its totient is φ = 65935975320.
The previous prime is 100110111109. The next prime is 100110111151. The reversal of 100110111111 is 111111011001.
It is not a de Polignac number, because 100110111111 - 21 = 100110111109 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
100110111111 is a modest number, since divided by 111111 gives 100110 as remainder.
It is a junction number, because it is equal to n+sod(n) for n = 100110111093 and 100110111102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100110111151) 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, 22333795 + ... + 22338276.
It is an arithmetic number, because the mean of its divisors is an integer number (9381135120).
Almost surely, 2100110111111 is an apocalyptic number.
100110111111 is a deficient number, since it is larger than the sum of its proper divisors (49988050809).
100110111111 is an equidigital number, since it uses as much as digits as its factorization.
100110111111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44672163 (or 44672157 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 100110111111 its reverse (111111011001), we get a palindrome (211221122112).
The spelling of 100110111111 in words is "one hundred billion, one hundred ten million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •