Base | Representation |
---|---|
bin | 1001001001100110010010… |
… | …00111100000010011011001 |
3 | 2122020112211011012022000210 |
4 | 10210303021013200103121 |
5 | 10114130302224032301 |
6 | 110443243225321333 |
7 | 4144460106411021 |
oct | 444631107402331 |
9 | 78215734168023 |
10 | 20121001002201 |
11 | 64582a556aa00 |
12 | 230b702636249 |
13 | b2c52c9994a8 |
14 | 4d7c0c4d2a81 |
15 | 24d5d7b69ad6 |
hex | 124cc91e04d9 |
20121001002201 has 48 divisors (see below), whose sum is σ = 29623786920000. Its totient is φ = 12138779959680.
The previous prime is 20121001002197. The next prime is 20121001002209. The reversal of 20121001002201 is 10220010012102.
It is not a de Polignac number, because 20121001002201 - 22 = 20121001002197 is a prime.
It is not an unprimeable number, because it can be changed into a prime (20121001002209) 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, 70319515 + ... + 70605071.
It is an arithmetic number, because the mean of its divisors is an integer number (617162227500).
Almost surely, 220121001002201 is an apocalyptic number.
It is an amenable number.
20121001002201 is a deficient number, since it is larger than the sum of its proper divisors (9502785917799).
20121001002201 is a wasteful number, since it uses less digits than its factorization.
20121001002201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 286470 (or 286459 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 20121001002201 its reverse (10220010012102), we get a palindrome (30341011014303).
Subtracting from 20121001002201 its reverse (10220010012102), we obtain a palindrome (9900990990099).
The spelling of 20121001002201 in words is "twenty trillion, one hundred twenty-one billion, one million, two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •