Base | Representation |
---|---|
bin | 1011101001000011101… |
… | …1111000000110010101 |
3 | 201010020100111022202102 |
4 | 2322100323320012111 |
5 | 11234100012022442 |
6 | 231513452251445 |
7 | 20310121615421 |
oct | 2722073700625 |
9 | 633210438672 |
10 | 200000110997 |
11 | 77901937635 |
12 | 32917770b85 |
13 | 15b2435a85b |
14 | 997410db81 |
15 | 5308497232 |
hex | 2e90ef8195 |
200000110997 has 2 divisors, whose sum is σ = 200000110998. Its totient is φ = 200000110996.
The previous prime is 200000110993. The next prime is 200000111029. The reversal of 200000110997 is 799011000002.
200000110997 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 165910397041 + 34089713956 = 407321^2 + 184634^2 .
It is a cyclic number.
It is not a de Polignac number, because 200000110997 - 22 = 200000110993 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200000110993) 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, 100000055498 + 100000055499.
It is an arithmetic number, because the mean of its divisors is an integer number (100000055499).
Almost surely, 2200000110997 is an apocalyptic number.
It is an amenable number.
200000110997 is a deficient number, since it is larger than the sum of its proper divisors (1).
200000110997 is an equidigital number, since it uses as much as digits as its factorization.
200000110997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1134, while the sum is 29.
Adding to 200000110997 its reverse (799011000002), we get a palindrome (999011110999).
The spelling of 200000110997 in words is "two hundred billion, one hundred ten thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •