Base | Representation |
---|---|
bin | 1010000011110101110011… |
… | …11011101011000011011001 |
3 | 2220022212021020001110112022 |
4 | 11001322321323223003121 |
5 | 10344422231424032301 |
6 | 115014444314424225 |
7 | 4442163522634256 |
oct | 501727173530331 |
9 | 86285236043468 |
10 | 22122201002201 |
11 | 7059a77817523 |
12 | 2593520432075 |
13 | c46164a25021 |
14 | 566a124b242d |
15 | 2856b1182d1b |
hex | 141eb9eeb0d9 |
22122201002201 has 2 divisors, whose sum is σ = 22122201002202. Its totient is φ = 22122201002200.
The previous prime is 22122201002179. The next prime is 22122201002227. The reversal of 22122201002201 is 10220010222122.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14106371664025 + 8015829338176 = 3755845^2 + 2831224^2 .
It is a cyclic number.
It is not a de Polignac number, because 22122201002201 - 230 = 22121127260377 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 22122201002201.
It is not a weakly prime, because it can be changed into another prime (22122201002101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11061100501100 + 11061100501101.
It is an arithmetic number, because the mean of its divisors is an integer number (11061100501101).
Almost surely, 222122201002201 is an apocalyptic number.
It is an amenable number.
22122201002201 is a deficient number, since it is larger than the sum of its proper divisors (1).
22122201002201 is an equidigital number, since it uses as much as digits as its factorization.
22122201002201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 22122201002201 its reverse (10220010222122), we get a palindrome (32342211224323).
The spelling of 22122201002201 in words is "twenty-two trillion, one hundred twenty-two billion, two hundred one million, two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •