Base | Representation |
---|---|
bin | 111101000000011110… |
… | …1010111010001010111 |
3 | 110112011111022002002110 |
4 | 1322000331113101113 |
5 | 4121303210314011 |
6 | 140104130242103 |
7 | 12315420425541 |
oct | 1720075272127 |
9 | 415144262073 |
10 | 131012588631 |
11 | 50620210a41 |
12 | 21483a26333 |
13 | c47b8cb8c2 |
14 | 64abb72691 |
15 | 361bbceba6 |
hex | 1e80f57457 |
131012588631 has 8 divisors (see below), whose sum is σ = 178944023664. Its totient is φ = 85211439680.
The previous prime is 131012588611. The next prime is 131012588633. The reversal of 131012588631 is 136885210131.
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 131012588631 - 211 = 131012586583 is a prime.
It is a super-2 number, since 2×1310125886312 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 131012588631.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131012588633) 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, 532571376 + ... + 532571621.
It is an arithmetic number, because the mean of its divisors is an integer number (22368002958).
Almost surely, 2131012588631 is an apocalyptic number.
131012588631 is a deficient number, since it is larger than the sum of its proper divisors (47931435033).
131012588631 is a wasteful number, since it uses less digits than its factorization.
131012588631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1065143041.
The product of its (nonzero) digits is 34560, while the sum is 39.
Adding to 131012588631 its reverse (136885210131), we get a palindrome (267897798762).
The spelling of 131012588631 in words is "one hundred thirty-one billion, twelve million, five hundred eighty-eight thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •