Base | Representation |
---|---|
bin | 1001000110010111111001… |
… | …11000000100100011110001 |
3 | 2121211221211020222110122102 |
4 | 10203023330320010203301 |
5 | 10110321342224100222 |
6 | 110320320432150145 |
7 | 4133455262334152 |
oct | 443137470044361 |
9 | 77757736873572 |
10 | 20010200221937 |
11 | 64153073a6822 |
12 | 22b213b698355 |
13 | b21c52605513 |
14 | 4d26dac1d929 |
15 | 24a7a05e3d92 |
hex | 1232fce048f1 |
20010200221937 has 2 divisors, whose sum is σ = 20010200221938. Its totient is φ = 20010200221936.
The previous prime is 20010200221903. The next prime is 20010200222027. The reversal of 20010200221937 is 73912200201002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16541334946816 + 3468865275121 = 4067104^2 + 1862489^2 .
It is a cyclic number.
It is not a de Polignac number, because 20010200221937 - 26 = 20010200221873 is a prime.
It is a super-2 number, since 2×200102002219372 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20010200221337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10005100110968 + 10005100110969.
It is an arithmetic number, because the mean of its divisors is an integer number (10005100110969).
Almost surely, 220010200221937 is an apocalyptic number.
It is an amenable number.
20010200221937 is a deficient number, since it is larger than the sum of its proper divisors (1).
20010200221937 is an equidigital number, since it uses as much as digits as its factorization.
20010200221937 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3024, while the sum is 29.
Adding to 20010200221937 its reverse (73912200201002), we get a palindrome (93922400422939).
The spelling of 20010200221937 in words is "twenty trillion, ten billion, two hundred million, two hundred twenty-one thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •