Base | Representation |
---|---|
bin | 111100011000010… |
… | …011001100010111 |
3 | 2121121010212220210 |
4 | 330120103030113 |
5 | 4033312044111 |
6 | 244304100503 |
7 | 34050245415 |
oct | 7430231427 |
9 | 2547125823 |
10 | 1013003031 |
11 | 47a8a5197 |
12 | 243304733 |
13 | 131b408a1 |
14 | 987742b5 |
15 | 5ddee0a6 |
hex | 3c613317 |
1013003031 has 32 divisors (see below), whose sum is σ = 1506758400. Its totient is φ = 602622720.
The previous prime is 1013003029. The next prime is 1013003081. The reversal of 1013003031 is 1303003101.
1013003031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1013003031 - 21 = 1013003029 is a prime.
It is a super-2 number, since 2×10130030312 = 2052350281630373922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1013002998 and 1013003016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1013003011) 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, 60300 + ... + 75246.
It is an arithmetic number, because the mean of its divisors is an integer number (47086200).
Almost surely, 21013003031 is an apocalyptic number.
1013003031 is a deficient number, since it is larger than the sum of its proper divisors (493755369).
1013003031 is a wasteful number, since it uses less digits than its factorization.
1013003031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15039.
The product of its (nonzero) digits is 27, while the sum is 12.
The square root of 1013003031 is about 31827.7085414580. The cubic root of 1013003031 is about 1004.3156916785.
Adding to 1013003031 its reverse (1303003101), we get a palindrome (2316006132).
The spelling of 1013003031 in words is "one billion, thirteen million, three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •