Base | Representation |
---|---|
bin | 1001000111010011111000… |
… | …1100101011000110001011 |
3 | 1022111000110210221011211021 |
4 | 2101310332030223012023 |
5 | 2303141410231224321 |
6 | 33151402102013311 |
7 | 2053002506226202 |
oct | 221647614530613 |
9 | 38430423834737 |
10 | 10021202211211 |
11 | 3213a7143a124 |
12 | 115a214417237 |
13 | 578cc291cc29 |
14 | 269058d5c239 |
15 | 125a1b4d4941 |
hex | 91d3e32b18b |
10021202211211 has 4 divisors (see below), whose sum is σ = 10042940177424. Its totient is φ = 9999464245000.
The previous prime is 10021202211203. The next prime is 10021202211227. The reversal of 10021202211211 is 11211220212001.
10021202211211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10021202211211 - 23 = 10021202211203 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10021202251211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10868982415 + ... + 10868983336.
It is an arithmetic number, because the mean of its divisors is an integer number (2510735044356).
Almost surely, 210021202211211 is an apocalyptic number.
10021202211211 is a deficient number, since it is larger than the sum of its proper divisors (21737966213).
10021202211211 is an equidigital number, since it uses as much as digits as its factorization.
10021202211211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21737966212.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 10021202211211 its reverse (11211220212001), we get a palindrome (21232422423212).
The spelling of 10021202211211 in words is "ten trillion, twenty-one billion, two hundred two million, two hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.137 sec. • engine limits •