Base | Representation |
---|---|
bin | 11101100100000010110111… |
… | …101100111111101010010011 |
3 | 122001100211012111021102022002 |
4 | 131210002313230333222103 |
5 | 114020223114443311011 |
6 | 1140310303235304215 |
7 | 36246442015015103 |
oct | 3544026754775223 |
9 | 561324174242262 |
10 | 130020332010131 |
11 | 38479349884392 |
12 | 126ba98a14b06b |
13 | 5771b31987804 |
14 | 24170365cb203 |
15 | 10071d9547c3b |
hex | 7640b7b3fa93 |
130020332010131 has 8 divisors (see below), whose sum is σ = 130790829574080. Its totient is φ = 129250324746472.
The previous prime is 130020332010119. The next prime is 130020332010169. The reversal of 130020332010131 is 131010233020031.
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 130020332010131 - 242 = 125622285499027 is a prime.
It is a super-2 number, since 2×1300203320101312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130020332010731) 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, 122043125 + ... + 123103878.
It is an arithmetic number, because the mean of its divisors is an integer number (16348853696760).
Almost surely, 2130020332010131 is an apocalyptic number.
130020332010131 is a deficient number, since it is larger than the sum of its proper divisors (770497563949).
130020332010131 is a wasteful number, since it uses less digits than its factorization.
130020332010131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 245150145.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 130020332010131 its reverse (131010233020031), we get a palindrome (261030565030162).
The spelling of 130020332010131 in words is "one hundred thirty trillion, twenty billion, three hundred thirty-two million, ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •