Base | Representation |
---|---|
bin | 1011101001000011101… |
… | …1100001111100001101 |
3 | 201010020100022201020221 |
4 | 2322100323201330031 |
5 | 11234100001121422 |
6 | 231513450311341 |
7 | 20310121060003 |
oct | 2722073417415 |
9 | 633210281227 |
10 | 200000020237 |
11 | 77901885426 |
12 | 32917728551 |
13 | 15b24328454 |
14 | 99740c8a73 |
15 | 530847a3c7 |
hex | 2e90ee1f0d |
200000020237 has 2 divisors, whose sum is σ = 200000020238. Its totient is φ = 200000020236.
The previous prime is 200000020229. The next prime is 200000020273. The reversal of 200000020237 is 732020000002.
It is a happy number.
Together with next prime (200000020273) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 196218877156 + 3781143081 = 442966^2 + 61491^2 .
It is a cyclic number.
It is not a de Polignac number, because 200000020237 - 23 = 200000020229 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 200000020237.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200000020217) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100000010118 + 100000010119.
It is an arithmetic number, because the mean of its divisors is an integer number (100000010119).
Almost surely, 2200000020237 is an apocalyptic number.
It is an amenable number.
200000020237 is a deficient number, since it is larger than the sum of its proper divisors (1).
200000020237 is an equidigital number, since it uses as much as digits as its factorization.
200000020237 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 168, while the sum is 16.
Adding to 200000020237 its reverse (732020000002), we get a palindrome (932020020239).
The spelling of 200000020237 in words is "two hundred billion, twenty thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •