Base | Representation |
---|---|
bin | 1001000110101100001101… |
… | …00011111000110000101101 |
3 | 2121212222221220001201101122 |
4 | 10203112012203320300231 |
5 | 10111011203112334013 |
6 | 110325322202550325 |
7 | 4134322345055006 |
oct | 443260643706055 |
9 | 77788856051348 |
10 | 20021100121133 |
11 | 64199a0084381 |
12 | 22b4281b083a5 |
13 | b22c9b882507 |
14 | 4d30526b41ad |
15 | 24abdc4ada08 |
hex | 1235868f8c2d |
20021100121133 has 2 divisors, whose sum is σ = 20021100121134. Its totient is φ = 20021100121132.
The previous prime is 20021100121097. The next prime is 20021100121147. The reversal of 20021100121133 is 33112100112002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17654677852009 + 2366422269124 = 4201747^2 + 1538318^2 .
It is a cyclic number.
It is not a de Polignac number, because 20021100121133 - 26 = 20021100121069 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20021100121163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10010550060566 + 10010550060567.
It is an arithmetic number, because the mean of its divisors is an integer number (10010550060567).
Almost surely, 220021100121133 is an apocalyptic number.
It is an amenable number.
20021100121133 is a deficient number, since it is larger than the sum of its proper divisors (1).
20021100121133 is an equidigital number, since it uses as much as digits as its factorization.
20021100121133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 20021100121133 its reverse (33112100112002), we get a palindrome (53133200233135).
The spelling of 20021100121133 in words is "twenty trillion, twenty-one billion, one hundred million, one hundred twenty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •