Base | Representation |
---|---|
bin | 1001001100100010101000… |
… | …11001111000110100111001 |
3 | 2122121012211110101102011222 |
4 | 10212101110121320310321 |
5 | 10122304401224231243 |
6 | 111001525321401425 |
7 | 4155000015522203 |
oct | 446212431706471 |
9 | 78535743342158 |
10 | 20222122102073 |
11 | 6497176811a21 |
12 | 2327223939275 |
13 | b38c26836828 |
14 | 4dca823c5773 |
15 | 251055507168 |
hex | 126454678d39 |
20222122102073 has 2 divisors, whose sum is σ = 20222122102074. Its totient is φ = 20222122102072.
The previous prime is 20222122102057. The next prime is 20222122102109. The reversal of 20222122102073 is 37020122122202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12443171590144 + 7778950511929 = 3527488^2 + 2789077^2 .
It is a cyclic number.
It is not a de Polignac number, because 20222122102073 - 24 = 20222122102057 is a prime.
It is a super-2 number, since 2×202221221020732 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20222122102373) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10111061051036 + 10111061051037.
It is an arithmetic number, because the mean of its divisors is an integer number (10111061051037).
Almost surely, 220222122102073 is an apocalyptic number.
It is an amenable number.
20222122102073 is a deficient number, since it is larger than the sum of its proper divisors (1).
20222122102073 is an equidigital number, since it uses as much as digits as its factorization.
20222122102073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2688, while the sum is 26.
Adding to 20222122102073 its reverse (37020122122202), we get a palindrome (57242244224275).
The spelling of 20222122102073 in words is "twenty trillion, two hundred twenty-two billion, one hundred twenty-two million, one hundred two thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •