Base | Representation |
---|---|
bin | 111101000001000010… |
… | …1001000111111110011 |
3 | 110112012210201000122122 |
4 | 1322002011020333303 |
5 | 4121323014421111 |
6 | 140110041424455 |
7 | 12316036363436 |
oct | 1720205107763 |
9 | 415183630578 |
10 | 131031404531 |
11 | 5062a8a2675 |
12 | 2148a19b12b |
13 | c482789081 |
14 | 64b046d81d |
15 | 361d699cdb |
hex | 1e82148ff3 |
131031404531 has 16 divisors (see below), whose sum is σ = 137800550400. Its totient is φ = 124438628160.
The previous prime is 131031404521. The next prime is 131031404533. The reversal of 131031404531 is 135404130131.
It is a cyclic number.
It is not a de Polignac number, because 131031404531 - 210 = 131031403507 is a prime.
It is a super-2 number, since 2×1310314045312 (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 131031404531.
It is not an unprimeable number, because it can be changed into a prime (131031404533) 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 15 ways as a sum of consecutive naturals, for example, 304856 + ... + 595818.
It is an arithmetic number, because the mean of its divisors is an integer number (8612534400).
Almost surely, 2131031404531 is an apocalyptic number.
131031404531 is a deficient number, since it is larger than the sum of its proper divisors (6769145869).
131031404531 is a wasteful number, since it uses less digits than its factorization.
131031404531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 291266.
The product of its (nonzero) digits is 2160, while the sum is 26.
Adding to 131031404531 its reverse (135404130131), we get a palindrome (266435534662).
The spelling of 131031404531 in words is "one hundred thirty-one billion, thirty-one million, four hundred four thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •