Base | Representation |
---|---|
bin | 11101011101000010001… |
… | …10110001000001101101 |
3 | 10120202012102120212110212 |
4 | 32232201012301001231 |
5 | 113040104134020023 |
6 | 2052525441312205 |
7 | 133054542636155 |
oct | 16564106610155 |
9 | 3522172525425 |
10 | 1012020220013 |
11 | 360217038120 |
12 | 144177635665 |
13 | 7458268c96a |
14 | 36da6a09765 |
15 | 1b4d1b7ce78 |
hex | eba11b106d |
1012020220013 has 16 divisors (see below), whose sum is σ = 1152193680000. Its totient is φ = 879887215680.
The previous prime is 1012020220007. The next prime is 1012020220069. The reversal of 1012020220013 is 3100220202101.
It is a happy number.
It is not a de Polignac number, because 1012020220013 - 224 = 1012003442797 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 1012020220013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012020220313) 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 15 ways as a sum of consecutive naturals, for example, 1434863 + ... + 2020611.
It is an arithmetic number, because the mean of its divisors is an integer number (72012105000).
Almost surely, 21012020220013 is an apocalyptic number.
It is an amenable number.
1012020220013 is a deficient number, since it is larger than the sum of its proper divisors (140173459987).
1012020220013 is a wasteful number, since it uses less digits than its factorization.
1012020220013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 592612.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 1012020220013 its reverse (3100220202101), we get a palindrome (4112240422114).
The spelling of 1012020220013 in words is "one trillion, twelve billion, twenty million, two hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •