Base | Representation |
---|---|
bin | 1001001011111001011110… |
… | …00001000100010110111101 |
3 | 2122112002210010101102001202 |
4 | 10211330233001010112331 |
5 | 10121424120110032422 |
6 | 110543432220545245 |
7 | 4153255220004305 |
oct | 445745701042675 |
9 | 78462703342052 |
10 | 20200020002237 |
11 | 6488864750209 |
12 | 2322a959b2225 |
13 | b36b137b734a |
14 | 4db986c68605 |
15 | 2506aee5bb92 |
hex | 125f2f0445bd |
20200020002237 has 2 divisors, whose sum is σ = 20200020002238. Its totient is φ = 20200020002236.
The previous prime is 20200020002191. The next prime is 20200020002251. The reversal of 20200020002237 is 73220002000202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11015568498841 + 9184451503396 = 3318971^2 + 3030586^2 .
It is a cyclic number.
It is not a de Polignac number, because 20200020002237 - 214 = 20200019985853 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20200020002737) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10100010001118 + 10100010001119.
It is an arithmetic number, because the mean of its divisors is an integer number (10100010001119).
Almost surely, 220200020002237 is an apocalyptic number.
It is an amenable number.
20200020002237 is a deficient number, since it is larger than the sum of its proper divisors (1).
20200020002237 is an equidigital number, since it uses as much as digits as its factorization.
20200020002237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 672, while the sum is 20.
Adding to 20200020002237 its reverse (73220002000202), we get a palindrome (93420022002439).
The spelling of 20200020002237 in words is "twenty trillion, two hundred billion, twenty million, two thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •