Base | Representation |
---|---|
bin | 101101100001100111011000… |
… | …011001100101001100001101 |
3 | 222020221001021212112002211010 |
4 | 231201213120121211030031 |
5 | 202220414400440202341 |
6 | 1545500434513515433 |
7 | 60113366544666624 |
oct | 5541473031451415 |
9 | 866831255462733 |
10 | 200222121022221 |
11 | 588847a759a9a1 |
12 | 1a55847b272b79 |
13 | 8794b325242cc |
14 | 3762b3398a6bb |
15 | 182338459a716 |
hex | b619d866530d |
200222121022221 has 32 divisors (see below), whose sum is σ = 276594044179456. Its totient is φ = 128698476480000.
The previous prime is 200222121022219. The next prime is 200222121022291. The reversal of 200222121022221 is 122220121222002.
It is not a de Polignac number, because 200222121022221 - 21 = 200222121022219 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200222121022291) 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 31 ways as a sum of consecutive naturals, for example, 26261121 + ... + 33016521.
It is an arithmetic number, because the mean of its divisors is an integer number (8643563880608).
Almost surely, 2200222121022221 is an apocalyptic number.
It is an amenable number.
200222121022221 is a deficient number, since it is larger than the sum of its proper divisors (76371923157235).
200222121022221 is a wasteful number, since it uses less digits than its factorization.
200222121022221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6756613.
The product of its (nonzero) digits is 512, while the sum is 21.
Adding to 200222121022221 its reverse (122220121222002), we get a palindrome (322442242244223).
The spelling of 200222121022221 in words is "two hundred trillion, two hundred twenty-two billion, one hundred twenty-one million, twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •