Base | Representation |
---|---|
bin | 111101000000110111… |
… | …0011001011011010001 |
3 | 110112012101111010022011 |
4 | 1322001232121123101 |
5 | 4121320003130023 |
6 | 140105305542521 |
7 | 12315634612450 |
oct | 1720156313321 |
9 | 415171433264 |
10 | 131025442513 |
11 | 506274a0289 |
12 | 214881a4a41 |
13 | c48147c454 |
14 | 64ad75ab97 |
15 | 361cdbd50d |
hex | 1e81b996d1 |
131025442513 has 8 divisors (see below), whose sum is σ = 149801446080. Its totient is φ = 112263959760.
The previous prime is 131025442511. The next prime is 131025442519. The reversal of 131025442513 is 315244520131.
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 131025442513 - 21 = 131025442511 is a prime.
It is a super-3 number, since 3×1310254425133 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131025442511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3610858 + ... + 3646963.
It is an arithmetic number, because the mean of its divisors is an integer number (18725180760).
Almost surely, 2131025442513 is an apocalyptic number.
It is an amenable number.
131025442513 is a deficient number, since it is larger than the sum of its proper divisors (18776003567).
131025442513 is an equidigital number, since it uses as much as digits as its factorization.
131025442513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7260407.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 131025442513 its reverse (315244520131), we get a palindrome (446269962644).
The spelling of 131025442513 in words is "one hundred thirty-one billion, twenty-five million, four hundred forty-two thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •