Base | Representation |
---|---|
bin | 1001001100100010100111… |
… | …01100100100011111000001 |
3 | 2122121012210122000212011101 |
4 | 10212101103230210133001 |
5 | 10122304340204103043 |
6 | 111001524215014401 |
7 | 4154666512533211 |
oct | 446212354443701 |
9 | 78535718025141 |
10 | 20222110222273 |
11 | 6497170038503 |
12 | 232721b96a401 |
13 | b38c2423746b |
14 | 4dca809b2241 |
15 | 25105445c24d |
hex | 126453b247c1 |
20222110222273 has 2 divisors, whose sum is σ = 20222110222274. Its totient is φ = 20222110222272.
The previous prime is 20222110222207. The next prime is 20222110222343. The reversal of 20222110222273 is 37222201122202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19677537067969 + 544573154304 = 4435937^2 + 737952^2 .
It is a cyclic number.
It is not a de Polignac number, because 20222110222273 - 225 = 20222076667841 is a prime.
It is a super-2 number, since 2×202221102222732 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20222110262273) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10111055111136 + 10111055111137.
It is an arithmetic number, because the mean of its divisors is an integer number (10111055111137).
Almost surely, 220222110222273 is an apocalyptic number.
It is an amenable number.
20222110222273 is a deficient number, since it is larger than the sum of its proper divisors (1).
20222110222273 is an equidigital number, since it uses as much as digits as its factorization.
20222110222273 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5376, while the sum is 28.
Adding to 20222110222273 its reverse (37222201122202), we get a palindrome (57444311344475).
The spelling of 20222110222273 in words is "twenty trillion, two hundred twenty-two billion, one hundred ten million, two hundred twenty-two thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •