Base | Representation |
---|---|
bin | 1001010001101110000010… |
… | …0101001101100111111101 |
3 | 1100010010000221112211021120 |
4 | 2110123200211031213331 |
5 | 2314104120133242341 |
6 | 33405454040221153 |
7 | 2101633003163130 |
oct | 224334045154775 |
9 | 40103027484246 |
10 | 10200020212221 |
11 | 328289354aa34 |
12 | 11889ba16a7b9 |
13 | 58cb1c703598 |
14 | 27397db92217 |
15 | 12a4d505b066 |
hex | 946e094d9fd |
10200020212221 has 64 divisors (see below), whose sum is σ = 16241429864448. Its totient is φ = 5573838140928.
The previous prime is 10200020212181. The next prime is 10200020212243. The reversal of 10200020212221 is 12221202000201.
It is not a de Polignac number, because 10200020212221 - 29 = 10200020211709 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10200020212221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10200020292221) 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 63 ways as a sum of consecutive naturals, for example, 7047931 + ... + 8370983.
It is an arithmetic number, because the mean of its divisors is an integer number (253772341632).
Almost surely, 210200020212221 is an apocalyptic number.
It is an amenable number.
10200020212221 is a deficient number, since it is larger than the sum of its proper divisors (6041409652227).
10200020212221 is a wasteful number, since it uses less digits than its factorization.
10200020212221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1323290.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 10200020212221 its reverse (12221202000201), we get a palindrome (22421222212422).
The spelling of 10200020212221 in words is "ten trillion, two hundred billion, twenty million, two hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •