Base | Representation |
---|---|
bin | 111101000011011000… |
… | …1010101111001000101 |
3 | 110112102021210012021222 |
4 | 1322012301111321011 |
5 | 4122003141204144 |
6 | 140121532250125 |
7 | 12321013316051 |
oct | 1720661257105 |
9 | 415367705258 |
10 | 131110100549 |
11 | 506702630aa |
12 | 214b0610945 |
13 | c495b80a6c |
14 | 64baab6c61 |
15 | 36255422ee |
hex | 1e86c55e45 |
131110100549 has 2 divisors, whose sum is σ = 131110100550. Its totient is φ = 131110100548.
The previous prime is 131110100497. The next prime is 131110100567. The reversal of 131110100549 is 945001011131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 69494449924 + 61615650625 = 263618^2 + 248225^2 .
It is an emirp because it is prime and its reverse (945001011131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 131110100549 - 28 = 131110100293 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131110100249) 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 as a sum of consecutive naturals, namely, 65555050274 + 65555050275.
It is an arithmetic number, because the mean of its divisors is an integer number (65555050275).
Almost surely, 2131110100549 is an apocalyptic number.
It is an amenable number.
131110100549 is a deficient number, since it is larger than the sum of its proper divisors (1).
131110100549 is an equidigital number, since it uses as much as digits as its factorization.
131110100549 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540, while the sum is 26.
The spelling of 131110100549 in words is "one hundred thirty-one billion, one hundred ten million, one hundred thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •