Base | Representation |
---|---|
bin | 1001001100100110001101… |
… | …0111000011000011110101 |
3 | 1022210200220001121220122210 |
4 | 2103021203113003003311 |
5 | 2311133404110013023 |
6 | 33301221534244033 |
7 | 2062366165551450 |
oct | 223114327030365 |
9 | 38720801556583 |
10 | 10112020001013 |
11 | 3249535741857 |
12 | 117393b056619 |
13 | 584736cb34a8 |
14 | 26d5d26d6497 |
15 | 12808454e593 |
hex | 932635c30f5 |
10112020001013 has 32 divisors (see below), whose sum is σ = 15474767616000. Its totient is φ = 5753577422016.
The previous prime is 10112020000961. The next prime is 10112020001021. The reversal of 10112020001013 is 31010002021101.
It is not a de Polignac number, because 10112020001013 - 29 = 10112020000501 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10112020001013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10112020001113) 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, 11156643 + ... + 12028911.
It is an arithmetic number, because the mean of its divisors is an integer number (483586488000).
Almost surely, 210112020001013 is an apocalyptic number.
It is an amenable number.
10112020001013 is a deficient number, since it is larger than the sum of its proper divisors (5362747614987).
10112020001013 is a wasteful number, since it uses less digits than its factorization.
10112020001013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 874641.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 10112020001013 its reverse (31010002021101), we get a palindrome (41122022022114).
The spelling of 10112020001013 in words is "ten trillion, one hundred twelve billion, twenty million, one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •