Base | Representation |
---|---|
bin | 11101100101011001011110… |
… | …010110001010011010001001 |
3 | 122001200201020010121010001122 |
4 | 131211121132112022122021 |
5 | 114023234040431230004 |
6 | 1140421122432325025 |
7 | 36256243263016316 |
oct | 3545313626123211 |
9 | 561621203533048 |
10 | 130113322133129 |
11 | 3850482832a105 |
12 | 12714a003a3775 |
13 | 577a83111372a |
14 | 241b73867dd0d |
15 | 100982d166cbe |
hex | 76565e58a689 |
130113322133129 has 8 divisors (see below), whose sum is σ = 130576021161600. Its totient is φ = 129650643771696.
The previous prime is 130113322133117. The next prime is 130113322133141. The reversal of 130113322133129 is 921331223311031.
It is an interprime number because it is at equal distance from previous prime (130113322133117) and next prime (130113322133141).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 130113322133129 - 28 = 130113322132873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130113322133029) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7502147 + ... + 17790695.
It is an arithmetic number, because the mean of its divisors is an integer number (16322002645200).
Almost surely, 2130113322133129 is an apocalyptic number.
It is an amenable number.
130113322133129 is a deficient number, since it is larger than the sum of its proper divisors (462699028471).
130113322133129 is a wasteful number, since it uses less digits than its factorization.
130113322133129 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10333519.
The product of its (nonzero) digits is 17496, while the sum is 35.
The spelling of 130113322133129 in words is "one hundred thirty trillion, one hundred thirteen billion, three hundred twenty-two million, one hundred thirty-three thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •