Base | Representation |
---|---|
bin | 111101000011111111… |
… | …0110100110100101011 |
3 | 110112110201000010211012 |
4 | 1322013332310310223 |
5 | 4122023341143311 |
6 | 140123535454135 |
7 | 12321351054062 |
oct | 1720776646453 |
9 | 415421003735 |
10 | 131130412331 |
11 | 506807766a6 |
12 | 214b738734b |
13 | c49a143079 |
14 | 64bd6831d9 |
15 | 362720578b |
hex | 1e87fb4d2b |
131130412331 has 32 divisors (see below), whose sum is σ = 145687019520. Its totient is φ = 117525492000.
The previous prime is 131130412321. The next prime is 131130412333. The reversal of 131130412331 is 133214031131.
It is a cyclic number.
It is not a de Polignac number, because 131130412331 - 214 = 131130395947 is a prime.
It is a super-2 number, since 2×1311304123312 (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 = 131130412297 and 131130412306.
It is not an unprimeable number, because it can be changed into a prime (131130412333) 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 31 ways as a sum of consecutive naturals, for example, 29092580 + ... + 29097086.
It is an arithmetic number, because the mean of its divisors is an integer number (4552719360).
Almost surely, 2131130412331 is an apocalyptic number.
131130412331 is a deficient number, since it is larger than the sum of its proper divisors (14556607189).
131130412331 is a wasteful number, since it uses less digits than its factorization.
131130412331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5655.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 131130412331 its reverse (133214031131), we get a palindrome (264344443462).
The spelling of 131130412331 in words is "one hundred thirty-one billion, one hundred thirty million, four hundred twelve thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •