Base | Representation |
---|---|
bin | 111101000011001110… |
… | …0100101101100101001 |
3 | 110112101220112210121222 |
4 | 1322012130211230221 |
5 | 4122000243112030 |
6 | 140121215511425 |
7 | 12320616140135 |
oct | 1720634455451 |
9 | 415356483558 |
10 | 131104660265 |
11 | 506681877a7 |
12 | 214aa828575 |
13 | c4949c7767 |
14 | 64ba09c3c5 |
15 | 3624d1a3e5 |
hex | 1e86725b29 |
131104660265 has 4 divisors (see below), whose sum is σ = 157325592324. Its totient is φ = 104883728208.
The previous prime is 131104660261. The next prime is 131104660307. The reversal of 131104660265 is 562066401131.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 54302514841 + 76802145424 = 233029^2 + 277132^2 .
It is a cyclic number.
It is not a de Polignac number, because 131104660265 - 22 = 131104660261 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (131104660261) by changing a digit.
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, 13110466022 + ... + 13110466031.
It is an arithmetic number, because the mean of its divisors is an integer number (39331398081).
Almost surely, 2131104660265 is an apocalyptic number.
It is an amenable number.
131104660265 is a deficient number, since it is larger than the sum of its proper divisors (26220932059).
131104660265 is an equidigital number, since it uses as much as digits as its factorization.
131104660265 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26220932058.
The product of its (nonzero) digits is 25920, while the sum is 35.
The spelling of 131104660265 in words is "one hundred thirty-one billion, one hundred four million, six hundred sixty thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •