Base | Representation |
---|---|
bin | 1011101001001010111… |
… | …0001101001011001001 |
3 | 201010022102212222212211 |
4 | 2322102232031023021 |
5 | 11234130200103422 |
6 | 231520442505121 |
7 | 20310634432603 |
oct | 2722256151311 |
9 | 633272788784 |
10 | 200030081737 |
11 | 77917848042 |
12 | 329258051a1 |
13 | 15b2a622415 |
14 | 99780b2173 |
15 | 530ae17577 |
hex | 2e92b8d2c9 |
200030081737 has 2 divisors, whose sum is σ = 200030081738. Its totient is φ = 200030081736.
The previous prime is 200030081701. The next prime is 200030081753. The reversal of 200030081737 is 737180030002.
200030081737 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 142569677056 + 57460404681 = 377584^2 + 239709^2 .
It is a cyclic number.
It is not a de Polignac number, because 200030081737 - 223 = 200021693129 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200030081699 and 200030081708.
It is not a weakly prime, because it can be changed into another prime (200030081777) 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, 100015040868 + 100015040869.
It is an arithmetic number, because the mean of its divisors is an integer number (100015040869).
Almost surely, 2200030081737 is an apocalyptic number.
It is an amenable number.
200030081737 is a deficient number, since it is larger than the sum of its proper divisors (1).
200030081737 is an equidigital number, since it uses as much as digits as its factorization.
200030081737 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7056, while the sum is 31.
The spelling of 200030081737 in words is "two hundred billion, thirty million, eighty-one thousand, seven hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •