Base | Representation |
---|---|
bin | 111101000000011100… |
… | …0100100100011000101 |
3 | 110112011101221020201102 |
4 | 1322000320210203011 |
5 | 4121302400113133 |
6 | 140104043305445 |
7 | 12315403644002 |
oct | 1720070444305 |
9 | 415141836642 |
10 | 131011332293 |
11 | 5061a533046 |
12 | 2148351b285 |
13 | c47b57baca |
14 | 64ab9268a9 |
15 | 361ba327e8 |
hex | 1e80e248c5 |
131011332293 has 4 divisors (see below), whose sum is σ = 131209534668. Its totient is φ = 130813129920.
The previous prime is 131011332259. The next prime is 131011332307. The reversal of 131011332293 is 392233110131.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 392233110131 = 541 ⋅725014991.
It can be written as a sum of positive squares in 2 ways, for example, as 96409008004 + 34602324289 = 310498^2 + 186017^2 .
It is a cyclic number.
It is not a de Polignac number, because 131011332293 - 232 = 126716364997 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131011332253) 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, 99100196 + ... + 99101517.
It is an arithmetic number, because the mean of its divisors is an integer number (32802383667).
Almost surely, 2131011332293 is an apocalyptic number.
It is an amenable number.
131011332293 is a deficient number, since it is larger than the sum of its proper divisors (198202375).
131011332293 is an equidigital number, since it uses as much as digits as its factorization.
131011332293 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198202374.
The product of its (nonzero) digits is 2916, while the sum is 29.
The spelling of 131011332293 in words is "one hundred thirty-one billion, eleven million, three hundred thirty-two thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •