Base | Representation |
---|---|
bin | 111011100110111… |
… | …0001101001110101 |
3 | 12011101112121100012 |
4 | 1313031301221311 |
5 | 13044011144312 |
6 | 530245030005 |
7 | 100364366132 |
oct | 16715615165 |
9 | 5141477305 |
10 | 2000099957 |
11 | 937005779 |
12 | 4799b5305 |
13 | 25b4b09cb |
14 | 14d8c3589 |
15 | ba8d2322 |
hex | 77371a75 |
2000099957 has 2 divisors, whose sum is σ = 2000099958. Its totient is φ = 2000099956.
The previous prime is 2000099947. The next prime is 2000100097. The reversal of 2000099957 is 7599900002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1404300676 + 595799281 = 37474^2 + 24409^2 .
It is a cyclic number.
It is not a de Polignac number, because 2000099957 - 212 = 2000095861 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2000099947) 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, 1000049978 + 1000049979.
It is an arithmetic number, because the mean of its divisors is an integer number (1000049979).
Almost surely, 22000099957 is an apocalyptic number.
It is an amenable number.
2000099957 is a deficient number, since it is larger than the sum of its proper divisors (1).
2000099957 is an equidigital number, since it uses as much as digits as its factorization.
2000099957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51030, while the sum is 41.
The square root of 2000099957 is about 44722.4770892669. The cubic root of 2000099957 is about 1259.9420391999.
Adding to 2000099957 its reverse (7599900002), we get a palindrome (9599999959).
It can be divided in two parts, 200009995 and 7, that added together give a palindrome (200010002).
The spelling of 2000099957 in words is "two billion, ninety-nine thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •