Base | Representation |
---|---|
bin | 1001001100011111000011… |
… | …1011100101101100010011 |
3 | 1022210111221021011221001101 |
4 | 2103013300323211230103 |
5 | 2311120441122401321 |
6 | 33300303234245231 |
7 | 2062300464532534 |
oct | 223076073455423 |
9 | 38714837157041 |
10 | 10110100200211 |
11 | 324873aaa2020 |
12 | 11734a4126817 |
13 | 5844bc33909b |
14 | 26d48d75668b |
15 | 127ec0c2e791 |
hex | 931f0ee5b13 |
10110100200211 has 32 divisors (see below), whose sum is σ = 11711171953152. Its totient is φ = 8625797736960.
The previous prime is 10110100200113. The next prime is 10110100200223. The reversal of 10110100200211 is 11200200101101.
It is not a de Polignac number, because 10110100200211 - 215 = 10110100167443 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10110100200251) 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 31 ways as a sum of consecutive naturals, for example, 97313185 + ... + 97417021.
It is an arithmetic number, because the mean of its divisors is an integer number (365974123536).
Almost surely, 210110100200211 is an apocalyptic number.
10110100200211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10110100200211 is a deficient number, since it is larger than the sum of its proper divisors (1601071752941).
10110100200211 is a wasteful number, since it uses less digits than its factorization.
10110100200211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105339.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10110100200211 its reverse (11200200101101), we get a palindrome (21310300301312).
The spelling of 10110100200211 in words is "ten trillion, one hundred ten billion, one hundred million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •