Base | Representation |
---|---|
bin | 101101011110100010000000… |
… | …111111100111110101000111 |
3 | 222020011210021210222210221101 |
4 | 231132202000333213311013 |
5 | 202203431343001430431 |
6 | 1545215230140400531 |
7 | 60062155145151265 |
oct | 5536420077476507 |
9 | 866153253883841 |
10 | 200010201201991 |
11 | 588029393613a4 |
12 | 1a523397846147 |
13 | 877ab5b86478b |
14 | 375678c79d435 |
15 | 181cace942961 |
hex | b5e880fe7d47 |
200010201201991 has 2 divisors, whose sum is σ = 200010201201992. Its totient is φ = 200010201201990.
The previous prime is 200010201201983. The next prime is 200010201202033. The reversal of 200010201201991 is 199102102010002.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 200010201201991 - 23 = 200010201201983 is a prime.
It is a super-2 number, since 2×2000102012019912 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200010201201691) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100005100600995 + 100005100600996.
It is an arithmetic number, because the mean of its divisors is an integer number (100005100600996).
Almost surely, 2200010201201991 is an apocalyptic number.
200010201201991 is a deficient number, since it is larger than the sum of its proper divisors (1).
200010201201991 is an equidigital number, since it uses as much as digits as its factorization.
200010201201991 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 28.
Adding to 200010201201991 its reverse (199102102010002), we get a palindrome (399112303211993).
The spelling of 200010201201991 in words is "two hundred trillion, ten billion, two hundred one million, two hundred one thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •