Base | Representation |
---|---|
bin | 1011101001011011110… |
… | …1100000100001000111 |
3 | 201010111101201021112022 |
4 | 2322112331200201013 |
5 | 11234301401430431 |
6 | 231531503113355 |
7 | 20312460103355 |
oct | 2722675404107 |
9 | 633441637468 |
10 | 200101201991 |
11 | 77953a03809 |
12 | 329455a285b |
13 | 15b3c293b02 |
14 | 99837067d5 |
15 | 53122b507b |
hex | 2e96f60847 |
200101201991 has 2 divisors, whose sum is σ = 200101201992. Its totient is φ = 200101201990.
The previous prime is 200101201987. The next prime is 200101202011. The reversal of 200101201991 is 199102101002.
200101201991 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 is a cyclic number.
It is not a de Polignac number, because 200101201991 - 22 = 200101201987 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 200101201991.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200101261991) 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, 100050600995 + 100050600996.
It is an arithmetic number, because the mean of its divisors is an integer number (100050600996).
Almost surely, 2200101201991 is an apocalyptic number.
200101201991 is a deficient number, since it is larger than the sum of its proper divisors (1).
200101201991 is an equidigital number, since it uses as much as digits as its factorization.
200101201991 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 26.
Adding to 200101201991 its reverse (199102101002), we get a palindrome (399203302993).
The spelling of 200101201991 in words is "two hundred billion, one hundred one million, two hundred one thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •