Base | Representation |
---|---|
bin | 11101011011011011010… |
… | …001000011101110001001 |
3 | 21011022221111021111111012 |
4 | 131123123101003232021 |
5 | 231113144201423423 |
6 | 4145012104413305 |
7 | 266051544343154 |
oct | 35333321035611 |
9 | 7138844244435 |
10 | 2022313311113 |
11 | 70a727162777 |
12 | 287b30777235 |
13 | 11891b294b44 |
14 | 6dc480aac9b |
15 | 37911d99078 |
hex | 1d6db443b89 |
2022313311113 has 2 divisors, whose sum is σ = 2022313311114. Its totient is φ = 2022313311112.
The previous prime is 2022313311059. The next prime is 2022313311173. The reversal of 2022313311113 is 3111133132202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1392088497424 + 630224813689 = 1179868^2 + 793867^2 .
It is a cyclic number.
It is not a de Polignac number, because 2022313311113 - 230 = 2021239569289 is a prime.
It is a super-2 number, since 2×20223133111132 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (2022313311173) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1011156655556 + 1011156655557.
It is an arithmetic number, because the mean of its divisors is an integer number (1011156655557).
Almost surely, 22022313311113 is an apocalyptic number.
It is an amenable number.
2022313311113 is a deficient number, since it is larger than the sum of its proper divisors (1).
2022313311113 is an equidigital number, since it uses as much as digits as its factorization.
2022313311113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 2022313311113 its reverse (3111133132202), we get a palindrome (5133446443315).
The spelling of 2022313311113 in words is "two trillion, twenty-two billion, three hundred thirteen million, three hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •