Base | Representation |
---|---|
bin | 10110110000110011101001… |
… | …001100011111001110000100 |
3 | 111010110112000102101220111121 |
4 | 112300303221030133032010 |
5 | 101110204322041200400 |
6 | 552530210234243324 |
7 | 30041532104341036 |
oct | 2660635114371604 |
9 | 433415012356447 |
10 | 100111010100100 |
11 | 2999792834945a |
12 | b28a226886544 |
13 | 43b25739a82cc |
14 | 1aa1582211c56 |
15 | b891b53e121a |
hex | 5b0ce931f384 |
100111010100100 has 36 divisors (see below), whose sum is σ = 217242158893200. Its totient is φ = 40044170496160.
The previous prime is 100111010100091. The next prime is 100111010100131. The reversal of 100111010100100 is 1001010111001.
It is a happy number.
It is an unprimeable number.
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, 14851011 + ... + 20512789.
It is an arithmetic number, because the mean of its divisors is an integer number (6034504413700).
Almost surely, 2100111010100100 is an apocalyptic number.
100111010100100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100111010100100 is an abundant number, since it is smaller than the sum of its proper divisors (117131148793100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100111010100100 is a wasteful number, since it uses less digits than its factorization.
100111010100100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5838612 (or 5838605 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 100111010100100 its reverse (1001010111001), we get a palindrome (101112020211101).
The spelling of 100111010100100 in words is "one hundred trillion, one hundred eleven billion, ten million, one hundred thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •