Base | Representation |
---|---|
bin | 10000011100011001111… |
… | …101101100101011010111 |
3 | 11000000202110221111011120 |
4 | 100130121331230223113 |
5 | 122003231033044111 |
6 | 2223041554535023 |
7 | 144432515354442 |
oct | 20343175545327 |
9 | 4000673844146 |
10 | 1130012003031 |
11 | 3a626535308a |
12 | 163006897473 |
13 | 827377b3852 |
14 | 3c99b358659 |
15 | 1e5da69b406 |
hex | 10719f6cad7 |
1130012003031 has 64 divisors (see below), whose sum is σ = 1662897600000. Its totient is φ = 679782039552.
The previous prime is 1130012003023. The next prime is 1130012003051. The reversal of 1130012003031 is 1303002100311.
It is not a de Polignac number, because 1130012003031 - 23 = 1130012003023 is a prime.
It is a super-2 number, since 2×11300120030312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1130012003031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1130012003051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 66046980 + ... + 66064086.
It is an arithmetic number, because the mean of its divisors is an integer number (25982775000).
Almost surely, 21130012003031 is an apocalyptic number.
1130012003031 is a deficient number, since it is larger than the sum of its proper divisors (532885596969).
1130012003031 is a wasteful number, since it uses less digits than its factorization.
1130012003031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17696.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 1130012003031 its reverse (1303002100311), we get a palindrome (2433014103342).
The spelling of 1130012003031 in words is "one trillion, one hundred thirty billion, twelve million, three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •