Base | Representation |
---|---|
bin | 1001001011111001111000… |
… | …1000011000011011000011 |
3 | 1022202120011210202122001110 |
4 | 2102332132020120123003 |
5 | 2310440022001011321 |
6 | 33251533115534403 |
7 | 2061465262626636 |
oct | 222763610303303 |
9 | 38676153678043 |
10 | 10100121110211 |
11 | 324448a06a000 |
12 | 117157a15a403 |
13 | 58358ba902c2 |
14 | 26cbc42b7c1d |
15 | 127ad9b02176 |
hex | 92f9e2186c3 |
10100121110211 has 64 divisors (see below), whose sum is σ = 15024618800640. Its totient is φ = 6034157712000.
The previous prime is 10100121110147. The next prime is 10100121110269. The reversal of 10100121110211 is 11201112100101.
It is not a de Polignac number, because 10100121110211 - 26 = 10100121110147 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10100121110011) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 92299416 + ... + 92408778.
It is an arithmetic number, because the mean of its divisors is an integer number (234759668760).
Almost surely, 210100121110211 is an apocalyptic number.
10100121110211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10100121110211 is a deficient number, since it is larger than the sum of its proper divisors (4924497690429).
10100121110211 is a wasteful number, since it uses less digits than its factorization.
10100121110211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109729 (or 109707 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 10100121110211 its reverse (11201112100101), we get a palindrome (21301233210312).
It can be divided in two parts, 101001 and 21110211, that added together give a palindrome (21211212).
The spelling of 10100121110211 in words is "ten trillion, one hundred billion, one hundred twenty-one million, one hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •