Base | Representation |
---|---|
bin | 1001001011111010001110… |
… | …0000000011010010111011 |
3 | 1022202120102002021201200011 |
4 | 2102332203200003102323 |
5 | 2310440213031414321 |
6 | 33251550054522351 |
7 | 2061500435451625 |
oct | 222764340032273 |
9 | 38676362251604 |
10 | 10100211201211 |
11 | 3244525a0277a |
12 | 11715a43663b7 |
13 | 5835a46447a1 |
14 | 26cbd2249c15 |
15 | 127ae299aae1 |
hex | 92fa38034bb |
10100211201211 has 8 divisors (see below), whose sum is σ = 10165249158464. Its totient is φ = 10035210725640.
The previous prime is 10100211201167. The next prime is 10100211201217. The reversal of 10100211201211 is 11210211200101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10100211201211 - 27 = 10100211201083 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10100211201191 and 10100211201200.
It is not an unprimeable number, because it can be changed into a prime (10100211201217) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8829645 + ... + 9907726.
It is an arithmetic number, because the mean of its divisors is an integer number (1270656144808).
Almost surely, 210100211201211 is an apocalyptic number.
10100211201211 is a deficient number, since it is larger than the sum of its proper divisors (65037957253).
10100211201211 is a wasteful number, since it uses less digits than its factorization.
10100211201211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18740841.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10100211201211 its reverse (11210211200101), we get a palindrome (21310422401312).
The spelling of 10100211201211 in words is "ten trillion, one hundred billion, two hundred eleven million, two hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •