Base | Representation |
---|---|
bin | 1001001001100100101001… |
… | …00111111011100101100001 |
3 | 2122020110112210000111121022 |
4 | 10210302110213323211201 |
5 | 10114122001244410423 |
6 | 110443020005135225 |
7 | 4144426223556425 |
oct | 444622447734541 |
9 | 78213483014538 |
10 | 20120120310113 |
11 | 64579934259aa |
12 | 230b4b76ba515 |
13 | b2c41c3a3205 |
14 | 4d7b67560b85 |
15 | 24d5856a3dc8 |
hex | 124c949fb961 |
20120120310113 has 8 divisors (see below), whose sum is σ = 20461792956000. Its totient is φ = 19778469452928.
The previous prime is 20120120310061. The next prime is 20120120310163. The reversal of 20120120310113 is 31101302102102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20120120310113 - 212 = 20120120306017 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20120120310091 and 20120120310100.
It is not an unprimeable number, because it can be changed into a prime (20120120310163) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3579263 + ... + 7283636.
It is an arithmetic number, because the mean of its divisors is an integer number (2557724119500).
Almost surely, 220120120310113 is an apocalyptic number.
It is an amenable number.
20120120310113 is a deficient number, since it is larger than the sum of its proper divisors (341672645887).
20120120310113 is a wasteful number, since it uses less digits than its factorization.
20120120310113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10894351.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 20120120310113 its reverse (31101302102102), we get a palindrome (51221422412215).
The spelling of 20120120310113 in words is "twenty trillion, one hundred twenty billion, one hundred twenty million, three hundred ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •