Base | Representation |
---|---|
bin | 101101100001010100101001… |
… | …000110011100000010000011 |
3 | 222020212010100121111110121221 |
4 | 231201110221012130002003 |
5 | 202220102144012400422 |
6 | 1545443310145055511 |
7 | 60112055124112123 |
oct | 5541245106340203 |
9 | 866763317443557 |
10 | 200202000121987 |
11 | 588772118a4826 |
12 | 1a5545a4927597 |
13 | 8792c76a98a96 |
14 | 3761b855d2c83 |
15 | 1822aa7dec3c7 |
hex | b6152919c083 |
200202000121987 has 4 divisors (see below), whose sum is σ = 200202925601680. Its totient is φ = 200201074642296.
The previous prime is 200202000121901. The next prime is 200202000122021. The reversal of 200202000121987 is 789121000202002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 200202000121987 - 215 = 200202000089219 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200202000191987) 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 in 3 ways as a sum of consecutive naturals, for example, 462415287 + ... + 462848032.
It is an arithmetic number, because the mean of its divisors is an integer number (50050731400420).
Almost surely, 2200202000121987 is an apocalyptic number.
200202000121987 is a deficient number, since it is larger than the sum of its proper divisors (925479693).
200202000121987 is an equidigital number, since it uses as much as digits as its factorization.
200202000121987 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 925479692.
The product of its (nonzero) digits is 8064, while the sum is 34.
Adding to 200202000121987 its reverse (789121000202002), we get a palindrome (989323000323989).
The spelling of 200202000121987 in words is "two hundred trillion, two hundred two billion, one hundred twenty-one thousand, nine hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •