Base | Representation |
---|---|
bin | 1001001001010101111011… |
… | …01111011100011101011001 |
3 | 2122012201011012120220000002 |
4 | 10210222331233130131121 |
5 | 10114004311333223113 |
6 | 110435232034422345 |
7 | 4144026365046536 |
oct | 444527557343531 |
9 | 78181135526002 |
10 | 20112220211033 |
11 | 64545a9a915a5 |
12 | 2309a71a319b5 |
13 | b2b76076a782 |
14 | 4d761825dd8d |
15 | 24d271d3dc58 |
hex | 124abdbdc759 |
20112220211033 has 2 divisors, whose sum is σ = 20112220211034. Its totient is φ = 20112220211032.
The previous prime is 20112220211011. The next prime is 20112220211063. The reversal of 20112220211033 is 33011202221102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13185991087504 + 6926229123529 = 3631252^2 + 2631773^2 .
It is a cyclic number.
It is not a de Polignac number, because 20112220211033 - 220 = 20112219162457 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20112220210996 and 20112220211014.
It is not a weakly prime, because it can be changed into another prime (20112220211063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10056110105516 + 10056110105517.
It is an arithmetic number, because the mean of its divisors is an integer number (10056110105517).
Almost surely, 220112220211033 is an apocalyptic number.
It is an amenable number.
20112220211033 is a deficient number, since it is larger than the sum of its proper divisors (1).
20112220211033 is an equidigital number, since it uses as much as digits as its factorization.
20112220211033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 20112220211033 its reverse (33011202221102), we get a palindrome (53123422432135).
The spelling of 20112220211033 in words is "twenty trillion, one hundred twelve billion, two hundred twenty million, two hundred eleven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •