Base | Representation |
---|---|
bin | 1001001001010010001111… |
… | …10110011100010101010001 |
3 | 2122012112001100212022211101 |
4 | 10210221013312130111101 |
5 | 10113441234014142113 |
6 | 110434303501544401 |
7 | 4143626360265355 |
oct | 444510766342521 |
9 | 78175040768741 |
10 | 20110242334033 |
11 | 6453784585305 |
12 | 23095bb575101 |
13 | b2b506a6ac57 |
14 | 4d74ab6c3465 |
15 | 24d1a839b2dd |
hex | 124a47d9c551 |
20110242334033 has 2 divisors, whose sum is σ = 20110242334034. Its totient is φ = 20110242334032.
The previous prime is 20110242334009. The next prime is 20110242334069. The reversal of 20110242334033 is 33043324201102.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 17959728603664 + 2150513730369 = 4237892^2 + 1466463^2 .
It is a cyclic number.
It is not a de Polignac number, because 20110242334033 - 25 = 20110242334001 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20110242333992 and 20110242334010.
It is not a weakly prime, because it can be changed into another prime (20110242334433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10055121167016 + 10055121167017.
It is an arithmetic number, because the mean of its divisors is an integer number (10055121167017).
Almost surely, 220110242334033 is an apocalyptic number.
It is an amenable number.
20110242334033 is a deficient number, since it is larger than the sum of its proper divisors (1).
20110242334033 is an equidigital number, since it uses as much as digits as its factorization.
20110242334033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 20110242334033 its reverse (33043324201102), we get a palindrome (53153566535135).
The spelling of 20110242334033 in words is "twenty trillion, one hundred ten billion, two hundred forty-two million, three hundred thirty-four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •