Base | Representation |
---|---|
bin | 1011101001110011111… |
… | …0011110111100101000 |
3 | 201010202102121111101101 |
4 | 2322130332132330220 |
5 | 11240003220333000 |
6 | 231545510131144 |
7 | 20315123644030 |
oct | 2723476367450 |
9 | 633672544341 |
10 | 200202121000 |
11 | 779a5972752 |
12 | 32973350ab4 |
13 | 15b571699bb |
14 | 9992c968c0 |
15 | 531b09be6a |
hex | 2e9cf9ef28 |
200202121000 has 64 divisors (see below), whose sum is σ = 535397690880. Its totient is φ = 68640724800.
The previous prime is 200202120971. The next prime is 200202121033. The reversal of 200202121000 is 121202002.
It is a super-7 number, since 7×2002021210007 (a number of 80 digits) contains 7777777 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14293152 + ... + 14307151.
It is an arithmetic number, because the mean of its divisors is an integer number (8365588920).
Almost surely, 2200202121000 is an apocalyptic number.
200202121000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200202121000 is an abundant number, since it is smaller than the sum of its proper divisors (335195569880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200202121000 is a wasteful number, since it uses less digits than its factorization.
200202121000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28600331 (or 28600317 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 200202121000 its reverse (121202002), we get a palindrome (200323323002).
The spelling of 200202121000 in words is "two hundred billion, two hundred two million, one hundred twenty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •