Base | Representation |
---|---|
bin | 1011101001000011111… |
… | …1010011110100110101 |
3 | 201010020102012001022202 |
4 | 2322100333103310311 |
5 | 11234100224322442 |
6 | 231513523434245 |
7 | 20310132354344 |
oct | 2722077236465 |
9 | 633212161282 |
10 | 200001010997 |
11 | 779023a1837 |
12 | 32917b25985 |
13 | 15b245b43b8 |
14 | 99742a5b5b |
15 | 53085c3c32 |
hex | 2e90fd3d35 |
200001010997 has 2 divisors, whose sum is σ = 200001010998. Its totient is φ = 200001010996.
The previous prime is 200001010949. The next prime is 200001011011. The reversal of 200001010997 is 799010100002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 198337513201 + 1663497796 = 445351^2 + 40786^2 .
It is a cyclic number.
It is not a de Polignac number, because 200001010997 - 216 = 200000945461 is a prime.
It is a super-2 number, since 2×2000010109972 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200001010897) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100000505498 + 100000505499.
It is an arithmetic number, because the mean of its divisors is an integer number (100000505499).
Almost surely, 2200001010997 is an apocalyptic number.
It is an amenable number.
200001010997 is a deficient number, since it is larger than the sum of its proper divisors (1).
200001010997 is an equidigital number, since it uses as much as digits as its factorization.
200001010997 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1134, while the sum is 29.
Adding to 200001010997 its reverse (799010100002), we get a palindrome (999011110999).
The spelling of 200001010997 in words is "two hundred billion, one million, ten thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •