Base | Representation |
---|---|
bin | 111101000001110010… |
… | …0101100001111010101 |
3 | 110112021112211121002121 |
4 | 1322003210230033111 |
5 | 4121400422440230 |
6 | 140112334335541 |
7 | 12316462315663 |
oct | 1720344541725 |
9 | 415245747077 |
10 | 131056452565 |
11 | 50642a50625 |
12 | 2149665a5b1 |
13 | c487a190ac |
14 | 64b390dc33 |
15 | 362099677a |
hex | 1e8392c3d5 |
131056452565 has 4 divisors (see below), whose sum is σ = 157267743084. Its totient is φ = 104845162048.
The previous prime is 131056452533. The next prime is 131056452599. The reversal of 131056452565 is 565254650131.
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: 565254650131 = 46061 ⋅12271871.
It can be written as a sum of positive squares in 2 ways, for example, as 20679015204 + 110377437361 = 143802^2 + 332231^2 .
It is a cyclic number.
It is not a de Polignac number, because 131056452565 - 25 = 131056452533 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 13105645252 + ... + 13105645261.
It is an arithmetic number, because the mean of its divisors is an integer number (39316935771).
Almost surely, 2131056452565 is an apocalyptic number.
It is an amenable number.
131056452565 is a deficient number, since it is larger than the sum of its proper divisors (26211290519).
131056452565 is an equidigital number, since it uses as much as digits as its factorization.
131056452565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26211290518.
The product of its (nonzero) digits is 540000, while the sum is 43.
The spelling of 131056452565 in words is "one hundred thirty-one billion, fifty-six million, four hundred fifty-two thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •