Base | Representation |
---|---|
bin | 1001001001100110101111… |
… | …00110100101100011101101 |
3 | 2122020120110002111110011022 |
4 | 10210303113212211203231 |
5 | 10114131301432444323 |
6 | 110443323310303525 |
7 | 4144466120210303 |
oct | 444632746454355 |
9 | 78216402443138 |
10 | 20121244031213 |
11 | 645840a772226 |
12 | 230b76bab7ba5 |
13 | b2c56b13ac40 |
14 | 4d7c328b6273 |
15 | 24d5ee1734c8 |
hex | 124cd79a58ed |
20121244031213 has 32 divisors (see below), whose sum is σ = 22342632547200. Its totient is φ = 18000186944256.
The previous prime is 20121244031209. The next prime is 20121244031237. The reversal of 20121244031213 is 31213044212102.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 20121244031213 - 22 = 20121244031209 is a prime.
It is a super-2 number, since 2×201212440312132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20121244030213) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 129511943 + ... + 129667211.
It is an arithmetic number, because the mean of its divisors is an integer number (698207267100).
Almost surely, 220121244031213 is an apocalyptic number.
It is an amenable number.
20121244031213 is a deficient number, since it is larger than the sum of its proper divisors (2221388515987).
20121244031213 is a wasteful number, since it uses less digits than its factorization.
20121244031213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 156381.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 20121244031213 its reverse (31213044212102), we get a palindrome (51334288243315).
The spelling of 20121244031213 in words is "twenty trillion, one hundred twenty-one billion, two hundred forty-four million, thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •