Base | Representation |
---|---|
bin | 111101000011011110… |
… | …0111001111111111111 |
3 | 110112102111111012201002 |
4 | 1322012330321333333 |
5 | 4122004430211111 |
6 | 140122121240515 |
7 | 12321051143150 |
oct | 1720674717777 |
9 | 415374435632 |
10 | 131113132031 |
11 | 50671a43762 |
12 | 214b163313b |
13 | c4966a283b |
14 | 64bb265927 |
15 | 362594063b |
hex | 1e86f39fff |
131113132031 has 8 divisors (see below), whose sum is σ = 153893406240. Its totient is φ = 109345314528.
The previous prime is 131113132013. The next prime is 131113132061. The reversal of 131113132031 is 130231311131.
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 131113132031 - 26 = 131113131967 is a prime.
It is a super-2 number, since 2×1311131320312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131113131994 and 131113132012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131113132061) 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, 253113896 + ... + 253114413.
It is an arithmetic number, because the mean of its divisors is an integer number (19236675780).
Almost surely, 2131113132031 is an apocalyptic number.
131113132031 is a deficient number, since it is larger than the sum of its proper divisors (22780274209).
131113132031 is an equidigital number, since it uses as much as digits as its factorization.
131113132031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 506228353.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 131113132031 its reverse (130231311131), we get a palindrome (261344443162).
The spelling of 131113132031 in words is "one hundred thirty-one billion, one hundred thirteen million, one hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •