Base | Representation |
---|---|
bin | 1011101001110101110… |
… | …0100101011111011001 |
3 | 201010202222110101222010 |
4 | 2322131130211133121 |
5 | 11240012230341441 |
6 | 231550351220133 |
7 | 20315251011150 |
oct | 2723534453731 |
9 | 633688411863 |
10 | 200210012121 |
11 | 779aa372439 |
12 | 32975b17649 |
13 | 15b589a06c2 |
14 | 9993d4c597 |
15 | 531bb0a116 |
hex | 2e9d7257d9 |
200210012121 has 16 divisors (see below), whose sum is σ = 321138867200. Its totient is φ = 108384367248.
The previous prime is 200210012081. The next prime is 200210012237. The reversal of 200210012121 is 121210012002.
It is not a de Polignac number, because 200210012121 - 29 = 200210011609 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 200210012097 and 200210012106.
It is not an unprimeable number, because it can be changed into a prime (200210012621) by changing a digit.
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, 250889341 + ... + 250890138.
It is an arithmetic number, because the mean of its divisors is an integer number (20071179200).
Almost surely, 2200210012121 is an apocalyptic number.
200210012121 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
200210012121 is a deficient number, since it is larger than the sum of its proper divisors (120928855079).
200210012121 is a wasteful number, since it uses less digits than its factorization.
200210012121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 501779508.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 200210012121 its reverse (121210012002), we get a palindrome (321420024123).
The spelling of 200210012121 in words is "two hundred billion, two hundred ten million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.136 sec. • engine limits •