Base | Representation |
---|---|
bin | 1001000111010011111000… |
… | …1100101011000010111001 |
3 | 1022111000110210221011112111 |
4 | 2101310332030223002321 |
5 | 2303141410231223001 |
6 | 33151402102012321 |
7 | 2053002506225452 |
oct | 221647614530271 |
9 | 38430423834474 |
10 | 10021202211001 |
11 | 3213a71439a53 |
12 | 115a2144170a1 |
13 | 578cc291cac7 |
14 | 269058d5c129 |
15 | 125a1b4d4851 |
hex | 91d3e32b0b9 |
10021202211001 has 2 divisors, whose sum is σ = 10021202211002. Its totient is φ = 10021202211000.
The previous prime is 10021202210969. The next prime is 10021202211019. The reversal of 10021202211001 is 10011220212001.
10021202211001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6553338882601 + 3467863328400 = 2559949^2 + 1862220^2 .
It is a cyclic number.
It is not a de Polignac number, because 10021202211001 - 25 = 10021202210969 is a prime.
It is not a weakly prime, because it can be changed into another prime (10021202212001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5010601105500 + 5010601105501.
It is an arithmetic number, because the mean of its divisors is an integer number (5010601105501).
Almost surely, 210021202211001 is an apocalyptic number.
It is an amenable number.
10021202211001 is a deficient number, since it is larger than the sum of its proper divisors (1).
10021202211001 is an equidigital number, since it uses as much as digits as its factorization.
10021202211001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10021202211001 its reverse (10011220212001), we get a palindrome (20032422423002).
The spelling of 10021202211001 in words is "ten trillion, twenty-one billion, two hundred two million, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •