Base | Representation |
---|---|
bin | 111101001111001101… |
… | …1111000000011000001 |
3 | 110120102221212012110112 |
4 | 1322132123320003001 |
5 | 4123311311021330 |
6 | 140225154041105 |
7 | 12333604063031 |
oct | 1723633700301 |
9 | 416387765415 |
10 | 131507126465 |
11 | 508543875a0 |
12 | 215a1579195 |
13 | c52a1c0740 |
14 | 65177058c1 |
15 | 364a319795 |
hex | 1e9e6f80c1 |
131507126465 has 64 divisors (see below), whose sum is σ = 187057382400. Its totient is φ = 87496416000.
The previous prime is 131507126459. The next prime is 131507126489. The reversal of 131507126465 is 564621705131.
It is a happy number.
It is not a de Polignac number, because 131507126465 - 28 = 131507126209 is a prime.
It is a super-2 number, since 2×1315071264652 (a number of 23 digits) contains 22 as substring.
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 63 ways as a sum of consecutive naturals, for example, 104453006 + ... + 104454264.
It is an arithmetic number, because the mean of its divisors is an integer number (2922771600).
Almost surely, 2131507126465 is an apocalyptic number.
It is an amenable number.
131507126465 is a deficient number, since it is larger than the sum of its proper divisors (55550255935).
131507126465 is a wasteful number, since it uses less digits than its factorization.
131507126465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2478.
The product of its (nonzero) digits is 151200, while the sum is 41.
The spelling of 131507126465 in words is "one hundred thirty-one billion, five hundred seven million, one hundred twenty-six thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •