Base | Representation |
---|---|
bin | 1001000110001000101101… |
… | …0111101100101000000011 |
3 | 1022102002101102111211110010 |
4 | 2101202023113230220003 |
5 | 2302324043130011321 |
6 | 33134223420240003 |
7 | 2051356436213406 |
oct | 221421327545003 |
9 | 38362342454403 |
10 | 10001022110211 |
11 | 3206456289600 |
12 | 11563220a0003 |
13 | 577127b37472 |
14 | 2680a2b93d3d |
15 | 125239a40676 |
hex | 9188b5eca03 |
10001022110211 has 24 divisors (see below), whose sum is σ = 14863584056832. Its totient is φ = 5975856132400.
The previous prime is 10001022110203. The next prime is 10001022110249. The reversal of 10001022110211 is 11201122010001.
It is not a de Polignac number, because 10001022110211 - 23 = 10001022110203 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10001022100211) 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 23 ways as a sum of consecutive naturals, for example, 193995531 + ... + 194047076.
It is an arithmetic number, because the mean of its divisors is an integer number (619316002368).
Almost surely, 210001022110211 is an apocalyptic number.
10001022110211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10001022110211 is a deficient number, since it is larger than the sum of its proper divisors (4862561946621).
10001022110211 is a wasteful number, since it uses less digits than its factorization.
10001022110211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 388042703 (or 388042692 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10001022110211 its reverse (11201122010001), we get a palindrome (21202144120212).
The spelling of 10001022110211 in words is "ten trillion, one billion, twenty-two million, one hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •