Base | Representation |
---|---|
bin | 101110101101100000… |
… | …0111001110001100110 |
3 | 100120220212020111122010 |
4 | 1131123000321301212 |
5 | 3120414132223420 |
6 | 114025441215050 |
7 | 10150543140345 |
oct | 1353300716146 |
9 | 316825214563 |
10 | 100311211110 |
11 | 395a6077670 |
12 | 17536031486 |
13 | 95c8134426 |
14 | 4bd8511b5c |
15 | 29217104e0 |
hex | 175b039c66 |
100311211110 has 64 divisors (see below), whose sum is σ = 263257185024. Its totient is φ = 24260073600.
The previous prime is 100311211103. The next prime is 100311211111. The reversal of 100311211110 is 11112113001.
100311211110 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100311211111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 222084 + ... + 499943.
It is an arithmetic number, because the mean of its divisors is an integer number (4113393516).
Almost surely, 2100311211110 is an apocalyptic number.
100311211110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100311211110 is an abundant number, since it is smaller than the sum of its proper divisors (162945973914).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100311211110 is a wasteful number, since it uses less digits than its factorization.
100311211110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 722469.
The product of its (nonzero) digits is 6, while the sum is 12.
Adding to 100311211110 its reverse (11112113001), we get a palindrome (111423324111).
The spelling of 100311211110 in words is "one hundred billion, three hundred eleven million, two hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •