Base | Representation |
---|---|
bin | 1001010011000000101111… |
… | …0011011111001110011101 |
3 | 1100012020100002202121122022 |
4 | 2110300023303133032131 |
5 | 2314440101333223401 |
6 | 33424004555225525 |
7 | 2103350101103003 |
oct | 224601363371635 |
9 | 40166302677568 |
10 | 10222220211101 |
11 | 32912458a8748 |
12 | 1191174a482a5 |
13 | 591c49b0c1b2 |
14 | 274a88314a73 |
15 | 12ad83ee371b |
hex | 94c0bcdf39d |
10222220211101 has 2 divisors, whose sum is σ = 10222220211102. Its totient is φ = 10222220211100.
The previous prime is 10222220211079. The next prime is 10222220211223. The reversal of 10222220211101 is 10111202222201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8196511332025 + 2025708879076 = 2862955^2 + 1423274^2 .
It is a cyclic number.
It is not a de Polignac number, because 10222220211101 - 214 = 10222220194717 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10222220211101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10222220211901) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5111110105550 + 5111110105551.
It is an arithmetic number, because the mean of its divisors is an integer number (5111110105551).
Almost surely, 210222220211101 is an apocalyptic number.
It is an amenable number.
10222220211101 is a deficient number, since it is larger than the sum of its proper divisors (1).
10222220211101 is an equidigital number, since it uses as much as digits as its factorization.
10222220211101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 10222220211101 its reverse (10111202222201), we get a palindrome (20333422433302).
The spelling of 10222220211101 in words is "ten trillion, two hundred twenty-two billion, two hundred twenty million, two hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •