Base | Representation |
---|---|
bin | 111101000011011000… |
… | …1010110000001101001 |
3 | 110112102021210020001021 |
4 | 1322012301112001221 |
5 | 4122003141213342 |
6 | 140121532252441 |
7 | 12321013320463 |
oct | 1720661260151 |
9 | 415367706037 |
10 | 131110101097 |
11 | 50670263558 |
12 | 214b0611121 |
13 | c495b810a1 |
14 | 64baab7133 |
15 | 3625542567 |
hex | 1e86c56069 |
131110101097 has 4 divisors (see below), whose sum is σ = 131110825300. Its totient is φ = 131109376896.
The previous prime is 131110101061. The next prime is 131110101121. The reversal of 131110101097 is 790101011131.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 48800786281 + 82309314816 = 220909^2 + 286896^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131110101097 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131110101037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 177073 + ... + 541825.
It is an arithmetic number, because the mean of its divisors is an integer number (32777706325).
Almost surely, 2131110101097 is an apocalyptic number.
It is an amenable number.
131110101097 is a deficient number, since it is larger than the sum of its proper divisors (724203).
131110101097 is an equidigital number, since it uses as much as digits as its factorization.
131110101097 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 724202.
The product of its (nonzero) digits is 189, while the sum is 25.
The spelling of 131110101097 in words is "one hundred thirty-one billion, one hundred ten million, one hundred one thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •