Base | Representation |
---|---|
bin | 1001000110000111001010… |
… | …01000110001011010101001 |
3 | 2121211002121212002002211112 |
4 | 10203003211020301122221 |
5 | 10110144440233342301 |
6 | 110312232511440105 |
7 | 4133016451660100 |
oct | 443034510613251 |
9 | 77732555062745 |
10 | 20001212012201 |
11 | 6411514828812 |
12 | 22b0451526035 |
13 | b2114c422914 |
14 | 4d20c71d7037 |
15 | 24a4264959bb |
hex | 1230e52316a9 |
20001212012201 has 48 divisors (see below), whose sum is σ = 23614112632320. Its totient is φ = 16889687539200.
The previous prime is 20001212012149. The next prime is 20001212012209. The reversal of 20001212012201 is 10221021210002.
It is not a de Polignac number, because 20001212012201 - 218 = 20001211750057 is a prime.
It is a super-4 number, since 4×200012120122014 (a number of 54 digits) contains 4444 as substring.
It is not an unprimeable number, because it can be changed into a prime (20001212012209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3409100870 + ... + 3409106736.
It is an arithmetic number, because the mean of its divisors is an integer number (491960679840).
Almost surely, 220001212012201 is an apocalyptic number.
It is an amenable number.
20001212012201 is a deficient number, since it is larger than the sum of its proper divisors (3612900620119).
20001212012201 is a wasteful number, since it uses less digits than its factorization.
20001212012201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9294 (or 9287 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 20001212012201 its reverse (10221021210002), we get a palindrome (30222233222203).
The spelling of 20001212012201 in words is "twenty trillion, one billion, two hundred twelve million, twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •