Base | Representation |
---|---|
bin | 1001001001000010111010… |
… | …01010101010010100001101 |
3 | 2122011201210122022111112121 |
4 | 10210201131022222110031 |
5 | 10113322404031134013 |
6 | 110430422542532541 |
7 | 4143215355630205 |
oct | 444413512522415 |
9 | 78151718274477 |
10 | 20102010021133 |
11 | 645023a664827 |
12 | 2307aa2597151 |
13 | b2a7c4368ba1 |
14 | 4d6d2a225405 |
15 | 24cd757b258d |
hex | 12485d2aa50d |
20102010021133 has 2 divisors, whose sum is σ = 20102010021134. Its totient is φ = 20102010021132.
The previous prime is 20102010021109. The next prime is 20102010021139. The reversal of 20102010021133 is 33112001020102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20065579809444 + 36430211689 = 4479462^2 + 190867^2 .
It is a cyclic number.
It is not a de Polignac number, because 20102010021133 - 233 = 20093420086541 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20102010021139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10051005010566 + 10051005010567.
It is an arithmetic number, because the mean of its divisors is an integer number (10051005010567).
Almost surely, 220102010021133 is an apocalyptic number.
It is an amenable number.
20102010021133 is a deficient number, since it is larger than the sum of its proper divisors (1).
20102010021133 is an equidigital number, since it uses as much as digits as its factorization.
20102010021133 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 16.
Adding to 20102010021133 its reverse (33112001020102), we get a palindrome (53214011041235).
The spelling of 20102010021133 in words is "twenty trillion, one hundred two billion, ten million, twenty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •