Base | Representation |
---|---|
bin | 1001010010010111101100… |
… | …0101001100001111010011 |
3 | 1100011011220020110201122021 |
4 | 2110211323011030033103 |
5 | 2314300020232033021 |
6 | 33414543405352311 |
7 | 2102510052531631 |
oct | 224457305141723 |
9 | 40134806421567 |
10 | 10211202221011 |
11 | 32876014a2710 |
12 | 118abbab68697 |
13 | 590bb225622c |
14 | 274320cc0351 |
15 | 12a93ba9dc41 |
hex | 9497b14c3d3 |
10211202221011 has 32 divisors (see below), whose sum is σ = 11661407170560. Its totient is φ = 8850637303200.
The previous prime is 10211202220951. The next prime is 10211202221041. The reversal of 10211202221011 is 11012220211201.
10211202221011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10211202221011 - 27 = 10211202220883 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10211202221041) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 103157580 + ... + 103256518.
It is an arithmetic number, because the mean of its divisors is an integer number (364418974080).
Almost surely, 210211202221011 is an apocalyptic number.
10211202221011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10211202221011 is a deficient number, since it is larger than the sum of its proper divisors (1450204949549).
10211202221011 is a wasteful number, since it uses less digits than its factorization.
10211202221011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100287.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 10211202221011 its reverse (11012220211201), we get a palindrome (21223422432212).
The spelling of 10211202221011 in words is "ten trillion, two hundred eleven billion, two hundred two million, two hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •