Base | Representation |
---|---|
bin | 1010000000111011001011… |
… | …00110110100000010111001 |
3 | 2212222021122011221202122211 |
4 | 11000131211212310002321 |
5 | 10341302030003000212 |
6 | 114500433522215121 |
7 | 4432015511315503 |
oct | 500354546640271 |
9 | 85867564852584 |
10 | 22022002000057 |
11 | 702052a020144 |
12 | 2578017ab44a1 |
13 | c39886c1a547 |
14 | 561c28c4cd73 |
15 | 282c997399a7 |
hex | 1407659b40b9 |
22022002000057 has 2 divisors, whose sum is σ = 22022002000058. Its totient is φ = 22022002000056.
The previous prime is 22022002000003. The next prime is 22022002000111. The reversal of 22022002000057 is 75000020022022.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (22022002000003) and next prime (22022002000111).
It can be written as a sum of positive squares in only one way, i.e., 22020691849641 + 1310150416 = 4692621^2 + 36196^2 .
It is a cyclic number.
It is not a de Polignac number, because 22022002000057 - 231 = 22019854516409 is a prime.
It is not a weakly prime, because it can be changed into another prime (22022002001057) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11011001000028 + 11011001000029.
It is an arithmetic number, because the mean of its divisors is an integer number (11011001000029).
Almost surely, 222022002000057 is an apocalyptic number.
It is an amenable number.
22022002000057 is a deficient number, since it is larger than the sum of its proper divisors (1).
22022002000057 is an equidigital number, since it uses as much as digits as its factorization.
22022002000057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1120, while the sum is 22.
Adding to 22022002000057 its reverse (75000020022022), we get a palindrome (97022022022079).
The spelling of 22022002000057 in words is "twenty-two trillion, twenty-two billion, two million, fifty-seven", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •