Base | Representation |
---|---|
bin | 11101100011110010110100… |
… | …101101101110011110000111 |
3 | 122001022011201200222021012220 |
4 | 131203302310231232132013 |
5 | 114014432323103013111 |
6 | 1140254333420343423 |
7 | 36245262026242320 |
oct | 3543626455563607 |
9 | 561264650867186 |
10 | 130003102001031 |
11 | 384720079a6546 |
12 | 126b757b9a4b73 |
13 | 5770317130c5c |
14 | 2416280157447 |
15 | 1006a2ba89e06 |
hex | 763cb4b6e787 |
130003102001031 has 32 divisors (see below), whose sum is σ = 201767141160960. Its totient is φ = 72923166860544.
The previous prime is 130003102001027. The next prime is 130003102001051. The reversal of 130003102001031 is 130100201300031.
It is not a de Polignac number, because 130003102001031 - 22 = 130003102001027 is a prime.
It is a super-2 number, since 2×1300031020010312 (a number of 29 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 130003102001031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130003102001051) 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, 226193710 + ... + 226767723.
It is an arithmetic number, because the mean of its divisors is an integer number (6305223161280).
Almost surely, 2130003102001031 is an apocalyptic number.
130003102001031 is a deficient number, since it is larger than the sum of its proper divisors (71764039159929).
130003102001031 is a wasteful number, since it uses less digits than its factorization.
130003102001031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 452961695.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 130003102001031 its reverse (130100201300031), we get a palindrome (260103303301062).
The spelling of 130003102001031 in words is "one hundred thirty trillion, three billion, one hundred two million, one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •