Base | Representation |
---|---|
bin | 101101100001011101111101… |
… | …001001110010011101011101 |
3 | 222020220002011112110010121020 |
4 | 231201131331021302131131 |
5 | 202220233134024033041 |
6 | 1545452042333554353 |
7 | 60112561002415605 |
oct | 5541357511623535 |
9 | 866802145403536 |
10 | 200212000221021 |
11 | 58880483677188 |
12 | 1a5565159459b9 |
13 | 8793bab7bc349 |
14 | 376245377dc05 |
15 | 1822e90cc9866 |
hex | b6177d27275d |
200212000221021 has 8 divisors (see below), whose sum is σ = 278555826394560. Its totient is φ = 127671420430752.
The previous prime is 200212000221019. The next prime is 200212000221061. The reversal of 200212000221021 is 120122000212002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200212000221021 - 21 = 200212000221019 is a prime.
It is a super-2 number, since 2×2002120002210212 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200212000221011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1450811595736 + ... + 1450811595873.
It is an arithmetic number, because the mean of its divisors is an integer number (34819478299320).
Almost surely, 2200212000221021 is an apocalyptic number.
It is an amenable number.
200212000221021 is a deficient number, since it is larger than the sum of its proper divisors (78343826173539).
200212000221021 is a wasteful number, since it uses less digits than its factorization.
200212000221021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2901623191635.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 200212000221021 its reverse (120122000212002), we get a palindrome (320334000433023).
The spelling of 200212000221021 in words is "two hundred trillion, two hundred twelve billion, two hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •