Base | Representation |
---|---|
bin | 11101010001111011110… |
… | …001010100100000000001 |
3 | 21010100122012001200102200 |
4 | 131101323301110200001 |
5 | 230431311013033441 |
6 | 4140204500503413 |
7 | 265241145120114 |
oct | 35217361244001 |
9 | 7110565050380 |
10 | 2012121221121 |
11 | 706376a78700 |
12 | 285b673aab69 |
13 | 11798585c86b |
14 | 6d55c62457b |
15 | 375171e57b6 |
hex | 1d47bc54801 |
2012121221121 has 18 divisors (see below), whose sum is σ = 3194635071810. Its totient is φ = 1219467406080.
The previous prime is 2012121221111. The next prime is 2012121221167. The reversal of 2012121221121 is 1211221212102.
2012121221121 is a `hidden beast` number, since 201 + 2 + 121 + 221 + 121 = 666.
It can be written as a sum of positive squares in only one way, i.e., 1813503928896 + 198617292225 = 1346664^2 + 445665^2 .
It is a de Polignac number, because none of the positive numbers 2k-2012121221121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2012121221094 and 2012121221103.
It is not an unprimeable number, because it can be changed into a prime (2012121221111) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 923837856 + ... + 923840033.
Almost surely, 22012121221121 is an apocalyptic number.
It is an amenable number.
2012121221121 is a deficient number, since it is larger than the sum of its proper divisors (1182513850689).
2012121221121 is a wasteful number, since it uses less digits than its factorization.
2012121221121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1847677917 (or 1847677903 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 2012121221121 its reverse (1211221212102), we get a palindrome (3223342433223).
The spelling of 2012121221121 in words is "two trillion, twelve billion, one hundred twenty-one million, two hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •