Base | Representation |
---|---|
bin | 111100101100001010… |
… | …1110011110011111011 |
3 | 110110102000000110010210 |
4 | 1321120111303303323 |
5 | 4113404232144011 |
6 | 135512344242203 |
7 | 12262504223145 |
oct | 1713025636373 |
9 | 413360013123 |
10 | 130331131131 |
11 | 50300586923 |
12 | 21313770363 |
13 | c3a0682406 |
14 | 6445463c95 |
15 | 35cbe716a6 |
hex | 1e58573cfb |
130331131131 has 16 divisors (see below), whose sum is σ = 173971820288. Its totient is φ = 86788994400.
The previous prime is 130331131127. The next prime is 130331131141. The reversal of 130331131131 is 131131133031.
It is not a de Polignac number, because 130331131131 - 22 = 130331131127 is a prime.
It is a super-2 number, since 2×1303311311312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130331131098 and 130331131107.
It is not an unprimeable number, because it can be changed into a prime (130331131141) 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 15 ways as a sum of consecutive naturals, for example, 10908621 + ... + 10920561.
It is an arithmetic number, because the mean of its divisors is an integer number (10873238768).
Almost surely, 2130331131131 is an apocalyptic number.
130331131131 is a deficient number, since it is larger than the sum of its proper divisors (43640689157).
130331131131 is a wasteful number, since it uses less digits than its factorization.
130331131131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15762.
The product of its (nonzero) digits is 243, while the sum is 21.
Adding to 130331131131 its reverse (131131133031), we get a palindrome (261462264162).
The spelling of 130331131131 in words is "one hundred thirty billion, three hundred thirty-one million, one hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •