Base | Representation |
---|---|
bin | 10110110000110010110011… |
… | …000100011001110101001011 |
3 | 111010110102200010200012201210 |
4 | 112300302303010121311023 |
5 | 101110200442103324321 |
6 | 552525540154544203 |
7 | 30041500436612415 |
oct | 2660626304316513 |
9 | 433412603605653 |
10 | 100110102011211 |
11 | 299975017a1876 |
12 | b28a012738063 |
13 | 43b245a80bbc6 |
14 | 1aa14d778b9b5 |
15 | b89160817b76 |
hex | 5b0cb3119d4b |
100110102011211 has 16 divisors (see below), whose sum is σ = 135732400748928. Its totient is φ = 65617759521600.
The previous prime is 100110102011201. The next prime is 100110102011261. The reversal of 100110102011211 is 112110201011001.
It is not a de Polignac number, because 100110102011211 - 222 = 100110097816907 is a prime.
It is not an unprimeable number, because it can be changed into a prime (100110102011201) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 477880125 + ... + 478089566.
It is an arithmetic number, because the mean of its divisors is an integer number (8483275046808).
Almost surely, 2100110102011211 is an apocalyptic number.
100110102011211 is a deficient number, since it is larger than the sum of its proper divisors (35622298737717).
100110102011211 is an equidigital number, since it uses as much as digits as its factorization.
100110102011211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 955970282.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 100110102011211 its reverse (112110201011001), we get a palindrome (212220303022212).
The spelling of 100110102011211 in words is "one hundred trillion, one hundred ten billion, one hundred two million, eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •