Base | Representation |
---|---|
bin | 111101001101011000… |
… | …0000100001001001111 |
3 | 110120021122112121020222 |
4 | 1322122300010021033 |
5 | 4123144444410111 |
6 | 140215105101555 |
7 | 12332223462140 |
oct | 1723260041117 |
9 | 416248477228 |
10 | 131445310031 |
11 | 508224a5a32 |
12 | 215849278bb |
13 | c51a458a79 |
14 | 650d413ac7 |
15 | 3644ba87db |
hex | 1e9ac0424f |
131445310031 has 8 divisors (see below), whose sum is σ = 150307290240. Its totient is φ = 112604349528.
The previous prime is 131445310027. The next prime is 131445310067. The reversal of 131445310031 is 130013544131.
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 131445310031 - 22 = 131445310027 is a prime.
It is a super-2 number, since 2×1314453100312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131445310001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5241521 + ... + 5266538.
It is an arithmetic number, because the mean of its divisors is an integer number (18788411280).
Almost surely, 2131445310031 is an apocalyptic number.
131445310031 is a deficient number, since it is larger than the sum of its proper divisors (18861980209).
131445310031 is a wasteful number, since it uses less digits than its factorization.
131445310031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10509853.
The product of its (nonzero) digits is 2160, while the sum is 26.
Adding to 131445310031 its reverse (130013544131), we get a palindrome (261458854162).
The spelling of 131445310031 in words is "one hundred thirty-one billion, four hundred forty-five million, three hundred ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •