Base | Representation |
---|---|
bin | 10111110110000… |
… | …01000000011101 |
3 | 111221101001212001 |
4 | 23323001000131 |
5 | 402201114442 |
6 | 31503042301 |
7 | 4646066452 |
oct | 1373010035 |
9 | 457331761 |
10 | 200019997 |
11 | a29a6a91 |
12 | 56ba0391 |
13 | 32593438 |
14 | 1c7c9829 |
15 | 128602b7 |
hex | bec101d |
200019997 has 2 divisors, whose sum is σ = 200019998. Its totient is φ = 200019996.
The previous prime is 200019979. The next prime is 200020031. The reversal of 200019997 is 799910002.
Together with previous prime (200019979) 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., 156275001 + 43744996 = 12501^2 + 6614^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200019997 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200019097) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100009998 + 100009999.
It is an arithmetic number, because the mean of its divisors is an integer number (100009999).
Almost surely, 2200019997 is an apocalyptic number.
It is an amenable number.
200019997 is a deficient number, since it is larger than the sum of its proper divisors (1).
200019997 is an equidigital number, since it uses as much as digits as its factorization.
200019997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10206, while the sum is 37.
The square root of 200019997 is about 14142.8426067746. The cubic root of 200019997 is about 584.8230375206.
Adding to 200019997 its reverse (799910002), we get a palindrome (999929999).
The spelling of 200019997 in words is "two hundred million, nineteen thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •