Base | Representation |
---|---|
bin | 11101011100111111110… |
… | …01101000101111110101 |
3 | 10120202011000112122020000 |
4 | 32232133321220233311 |
5 | 113040034000013023 |
6 | 2052523440101513 |
7 | 133054206035511 |
oct | 16563771505765 |
9 | 3522130478200 |
10 | 1012000001013 |
11 | 360206688301 |
12 | 144170904899 |
13 | 7457b430961 |
14 | 36da4065141 |
15 | 1b4ceed7243 |
hex | eb9fe68bf5 |
1012000001013 has 80 divisors (see below), whose sum is σ = 1568410905600. Its totient is φ = 649610876160.
The previous prime is 1012000000981. The next prime is 1012000001027. The reversal of 1012000001013 is 3101000002101.
It is not a de Polignac number, because 1012000001013 - 25 = 1012000000981 is a prime.
It is a super-3 number, since 3×10120000010133 (a number of 37 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1012000000986 and 1012000001004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012000001413) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 512923495 + ... + 512925467.
It is an arithmetic number, because the mean of its divisors is an integer number (19605136320).
Almost surely, 21012000001013 is an apocalyptic number.
It is an amenable number.
1012000001013 is a deficient number, since it is larger than the sum of its proper divisors (556410904587).
1012000001013 is a wasteful number, since it uses less digits than its factorization.
1012000001013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2944 (or 2935 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 1012000001013 its reverse (3101000002101), we get a palindrome (4113000003114).
The spelling of 1012000001013 in words is "one trillion, twelve billion, one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •