Base | Representation |
---|---|
bin | 10110110000110011101110… |
… | …100011110110100100000110 |
3 | 111010110112020200202221101201 |
4 | 112300303232203312210012 |
5 | 101110210013112023420 |
6 | 552530223211413114 |
7 | 30041534246410564 |
oct | 2660635643664406 |
9 | 433415220687351 |
10 | 100111100111110 |
11 | 29997974138020 |
12 | b28a250a5419a |
13 | 43b258953226a |
14 | 1aa1590162a34 |
15 | b891bd27110a |
hex | 5b0cee8f6906 |
100111100111110 has 256 divisors, whose sum is σ = 218618437847040. Its totient is φ = 32558662287360.
The previous prime is 100111100111027. The next prime is 100111100111111. The reversal of 100111100111110 is 11111001111001.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100111100111111) 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, 6383407329 + ... + 6383423011.
It is an arithmetic number, because the mean of its divisors is an integer number (853978272840).
Almost surely, 2100111100111110 is an apocalyptic number.
100111100111110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100111100111110 is an abundant number, since it is smaller than the sum of its proper divisors (118507337735930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100111100111110 is a wasteful number, since it uses less digits than its factorization.
100111100111110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16703.
The product of its (nonzero) digits is 1, while the sum is 10.
Adding to 100111100111110 its reverse (11111001111001), we get a palindrome (111222101222111).
The spelling of 100111100111110 in words is "one hundred trillion, one hundred eleven billion, one hundred million, one hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •