Base | Representation |
---|---|
bin | 1011101001100000100… |
… | …1000111001100011100 |
3 | 201010112210000012101112 |
4 | 2322120021013030130 |
5 | 11234321440134322 |
6 | 231533452001152 |
7 | 20313120420350 |
oct | 2723011071434 |
9 | 633483005345 |
10 | 200121021212 |
11 | 77964110232 |
12 | 329501601b8 |
13 | 15b43412b68 |
14 | 99861c5460 |
15 | 5313dcc5e2 |
hex | 2e9824731c |
200121021212 has 12 divisors (see below), whose sum is σ = 400242042480. Its totient is φ = 85766151936.
The previous prime is 200121021211. The next prime is 200121021229. The reversal of 200121021212 is 212120121002.
200121021212 is an admirable number.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200121021211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3573589637 + ... + 3573589692.
It is an arithmetic number, because the mean of its divisors is an integer number (33353503540).
Almost surely, 2200121021212 is an apocalyptic number.
It is an amenable number.
200121021212 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200121021212 is a wasteful number, since it uses less digits than its factorization.
200121021212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7147179340 (or 7147179338 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 200121021212 its reverse (212120121002), we get a palindrome (412241142214).
The spelling of 200121021212 in words is "two hundred billion, one hundred twenty-one million, twenty-one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •