Base | Representation |
---|---|
bin | 1010000110011001101110… |
… | …00101010010011000010101 |
3 | 2220122021102000201202210022 |
4 | 11003030313011102120111 |
5 | 10402342442201124001 |
6 | 115123120335034525 |
7 | 4451430314150033 |
oct | 503146705223025 |
9 | 86567360652708 |
10 | 22210200020501 |
11 | 7093324990429 |
12 | 25a859b06ba45 |
13 | c5154a11815c |
14 | 56ad9d73b553 |
15 | 287b11a0611b |
hex | 143337152615 |
22210200020501 has 2 divisors, whose sum is σ = 22210200020502. Its totient is φ = 22210200020500.
The previous prime is 22210200020479. The next prime is 22210200020509. The reversal of 22210200020501 is 10502000201222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12015755640625 + 10194444379876 = 3466375^2 + 3192874^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22210200020501 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 22210200020501.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22210200020509) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11105100010250 + 11105100010251.
It is an arithmetic number, because the mean of its divisors is an integer number (11105100010251).
Almost surely, 222210200020501 is an apocalyptic number.
It is an amenable number.
22210200020501 is a deficient number, since it is larger than the sum of its proper divisors (1).
22210200020501 is an equidigital number, since it uses as much as digits as its factorization.
22210200020501 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 160, while the sum is 17.
Adding to 22210200020501 its reverse (10502000201222), we get a palindrome (32712200221723).
The spelling of 22210200020501 in words is "twenty-two trillion, two hundred ten billion, two hundred million, twenty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •