Base | Representation |
---|---|
bin | 111101000100000010… |
… | …1010001000110100111 |
3 | 110112110211011221021122 |
4 | 1322020011101012213 |
5 | 4122024304213111 |
6 | 140124040004155 |
7 | 12321401316311 |
oct | 1721005210647 |
9 | 415424157248 |
10 | 131132101031 |
11 | 5068171a418 |
12 | 214b7a6065b |
13 | c49a5b48b9 |
14 | 64bd9a27b1 |
15 | 362743acdb |
hex | 1e881511a7 |
131132101031 has 4 divisors (see below), whose sum is σ = 136833496752. Its totient is φ = 125430705312.
The previous prime is 131132101021. The next prime is 131132101033. The reversal of 131132101031 is 130101231131.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 130101231131 = 1123 ⋅115851497.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131132101031 is a prime.
It is a super-2 number, since 2×1311321010312 (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 (131132101033) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2850697826 + ... + 2850697871.
It is an arithmetic number, because the mean of its divisors is an integer number (34208374188).
Almost surely, 2131132101031 is an apocalyptic number.
131132101031 is a deficient number, since it is larger than the sum of its proper divisors (5701395721).
131132101031 is an equidigital number, since it uses as much as digits as its factorization.
131132101031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5701395720.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 131132101031 its reverse (130101231131), we get a palindrome (261233332162).
The spelling of 131132101031 in words is "one hundred thirty-one billion, one hundred thirty-two million, one hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •