Base | Representation |
---|---|
bin | 10011001100011100… |
… | …111010100011101101 |
3 | 1222012100100112111022 |
4 | 103030130322203231 |
5 | 314202130014013 |
6 | 13245035503525 |
7 | 1326510055601 |
oct | 231434724355 |
9 | 58170315438 |
10 | 20610001133 |
11 | 8816898997 |
12 | 3bb22b7ba5 |
13 | 1c35b95757 |
14 | dd7313501 |
15 | 8095b2008 |
hex | 4cc73a8ed |
20610001133 has 2 divisors, whose sum is σ = 20610001134. Its totient is φ = 20610001132.
The previous prime is 20610001123. The next prime is 20610001141. The reversal of 20610001133 is 33110001602.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16338463684 + 4271537449 = 127822^2 + 65357^2 .
It is a cyclic number.
It is not a de Polignac number, because 20610001133 - 216 = 20609935597 is a prime.
It is a super-2 number, since 2×206100011332 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20610001103) 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, 10305000566 + 10305000567.
It is an arithmetic number, because the mean of its divisors is an integer number (10305000567).
Almost surely, 220610001133 is an apocalyptic number.
It is an amenable number.
20610001133 is a deficient number, since it is larger than the sum of its proper divisors (1).
20610001133 is an equidigital number, since it uses as much as digits as its factorization.
20610001133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 20610001133 its reverse (33110001602), we get a palindrome (53720002735).
The spelling of 20610001133 in words is "twenty billion, six hundred ten million, one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •