Base | Representation |
---|---|
bin | 111101001010010111… |
… | …1001011100100110111 |
3 | 110120000121200121100010 |
4 | 1322110233023210313 |
5 | 4122443132240111 |
6 | 140201102351303 |
7 | 12326560051464 |
oct | 1722457134467 |
9 | 416017617303 |
10 | 131344415031 |
11 | 50780553035 |
12 | 21556b8b533 |
13 | c502590a9b |
14 | 64ddc6c66b |
15 | 363adc8aa6 |
hex | 1e94bcb937 |
131344415031 has 8 divisors (see below), whose sum is σ = 184343038720. Its totient is φ = 82954367352.
The previous prime is 131344415021. The next prime is 131344415039. The reversal of 131344415031 is 130514443131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 131344415031 - 26 = 131344414967 is a prime.
It is a super-2 number, since 2×1313444150312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 131344415031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131344415039) 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, 1152143935 + ... + 1152144048.
It is an arithmetic number, because the mean of its divisors is an integer number (23042879840).
Almost surely, 2131344415031 is an apocalyptic number.
131344415031 is a deficient number, since it is larger than the sum of its proper divisors (52998623689).
131344415031 is a wasteful number, since it uses less digits than its factorization.
131344415031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2304288005.
The product of its (nonzero) digits is 8640, while the sum is 30.
Adding to 131344415031 its reverse (130514443131), we get a palindrome (261858858162).
The spelling of 131344415031 in words is "one hundred thirty-one billion, three hundred forty-four million, four hundred fifteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •