Base | Representation |
---|---|
bin | 110000000001011000011101… |
… | …110100000100000101111101 |
3 | 1000200210122021021222111122022 |
4 | 300001120131310010011331 |
5 | 210140310100313013041 |
6 | 2025104300230525525 |
7 | 62325533111345300 |
oct | 6001303564040575 |
9 | 1020718237874568 |
10 | 211201222001021 |
11 | 61327a318a695a |
12 | 1b830265b068a5 |
13 | 90b0260c2a715 |
14 | 3a2229d696b37 |
15 | 1963c6610224b |
hex | c0161dd0417d |
211201222001021 has 24 divisors (see below), whose sum is σ = 245812423764096. Its totient is φ = 180934310208960.
The previous prime is 211201222000999. The next prime is 211201222001047. The reversal of 211201222001021 is 120100222102112.
It is not a de Polignac number, because 211201222001021 - 230 = 211200148259197 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211201222001321) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1160795426 + ... + 1160977356.
It is an arithmetic number, because the mean of its divisors is an integer number (10242184323504).
Almost surely, 2211201222001021 is an apocalyptic number.
It is an amenable number.
211201222001021 is a deficient number, since it is larger than the sum of its proper divisors (34611201763075).
211201222001021 is a wasteful number, since it uses less digits than its factorization.
211201222001021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 194289 (or 194282 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 211201222001021 its reverse (120100222102112), we get a palindrome (331301444103133).
It can be divided in two parts, 211201 and 222001021, that added together give a palindrome (222212222).
The spelling of 211201222001021 in words is "two hundred eleven trillion, two hundred one billion, two hundred twenty-two million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •