Base | Representation |
---|---|
bin | 1001001011111101001111… |
… | …0101000101011001011101 |
3 | 1022202122111120222122121121 |
4 | 2102333103311011121131 |
5 | 2310443343114134323 |
6 | 33252202341330541 |
7 | 2061526512351424 |
oct | 222772365053135 |
9 | 38678446878547 |
10 | 10101022021213 |
11 | 3244901663852 |
12 | 117178ba06a51 |
13 | 5836a3615536 |
14 | 26cc6bbd02bb |
15 | 127b3dc5da5d |
hex | 92fd3d4565d |
10101022021213 has 2 divisors, whose sum is σ = 10101022021214. Its totient is φ = 10101022021212.
The previous prime is 10101022021199. The next prime is 10101022021229. The reversal of 10101022021213 is 31212022010101.
It is an a-pointer prime, because the next prime (10101022021229) can be obtained adding 10101022021213 to its sum of digits (16).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9938804792569 + 162217228644 = 3152587^2 + 402762^2 .
It is a cyclic number.
It is not a de Polignac number, because 10101022021213 - 213 = 10101022013021 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10101022021273) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050511010606 + 5050511010607.
It is an arithmetic number, because the mean of its divisors is an integer number (5050511010607).
Almost surely, 210101022021213 is an apocalyptic number.
It is an amenable number.
10101022021213 is a deficient number, since it is larger than the sum of its proper divisors (1).
10101022021213 is an equidigital number, since it uses as much as digits as its factorization.
10101022021213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 10101022021213 its reverse (31212022010101), we get a palindrome (41313044031314).
The spelling of 10101022021213 in words is "ten trillion, one hundred one billion, twenty-two million, twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.037 sec. • engine limits •