Base | Representation |
---|---|
bin | 111011100110101… |
… | …1101101100010101 |
3 | 12011101101110012001 |
4 | 1313031131230111 |
5 | 13044001040242 |
6 | 530243155301 |
7 | 100363605562 |
oct | 16715355425 |
9 | 5141343161 |
10 | 2000018197 |
11 | 936a5a301 |
12 | 479975b31 |
13 | 25b482728 |
14 | 14d8a1869 |
15 | ba8b7eb7 |
hex | 7735db15 |
2000018197 has 2 divisors, whose sum is σ = 2000018198. Its totient is φ = 2000018196.
The previous prime is 2000018191. The next prime is 2000018233. The reversal of 2000018197 is 7918100002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1420460721 + 579557476 = 37689^2 + 24074^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2000018197 is a prime.
It is a super-2 number, since 2×20000181972 = 8000145576662261618, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2000018191) 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, 1000009098 + 1000009099.
It is an arithmetic number, because the mean of its divisors is an integer number (1000009099).
Almost surely, 22000018197 is an apocalyptic number.
It is an amenable number.
2000018197 is a deficient number, since it is larger than the sum of its proper divisors (1).
2000018197 is an equidigital number, since it uses as much as digits as its factorization.
2000018197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 28.
The square root of 2000018197 is about 44721.5629981780. The cubic root of 2000018197 is about 1259.9248710138.
Adding to 2000018197 its reverse (7918100002), we get a palindrome (9918118199).
The spelling of 2000018197 in words is "two billion, eighteen thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •