Base | Representation |
---|---|
bin | 111100011000101… |
… | …101110011001101 |
3 | 2121121100102102011 |
4 | 330120231303031 |
5 | 4033324041023 |
6 | 244310301221 |
7 | 34051211224 |
oct | 7430556315 |
9 | 2547312364 |
10 | 1013112013 |
11 | 47a96a061 |
12 | 243357811 |
13 | 131b7b384 |
14 | 987a1cbb |
15 | 5de2150d |
hex | 3c62dccd |
1013112013 has 16 divisors (see below), whose sum is σ = 1074487680. Its totient is φ = 953732416.
The previous prime is 1013112011. The next prime is 1013112041. The reversal of 1013112013 is 3102113101.
It is a cyclic number.
It is not a de Polignac number, because 1013112013 - 21 = 1013112011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1013111984 and 1013112002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1013112011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 254706 + ... + 258652.
It is an arithmetic number, because the mean of its divisors is an integer number (67155480).
Almost surely, 21013112013 is an apocalyptic number.
It is an amenable number.
1013112013 is a deficient number, since it is larger than the sum of its proper divisors (61375667).
1013112013 is a wasteful number, since it uses less digits than its factorization.
1013112013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4196.
The product of its (nonzero) digits is 18, while the sum is 13.
The square root of 1013112013 is about 31829.4205570884. The cubic root of 1013112013 is about 1004.3517061834.
Adding to 1013112013 its reverse (3102113101), we get a palindrome (4115225114).
The spelling of 1013112013 in words is "one billion, thirteen million, one hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •