Base | Representation |
---|---|
bin | 111101000011011110… |
… | …1010100011111011101 |
3 | 110112102111200201112222 |
4 | 1322012331110133131 |
5 | 4122004442144131 |
6 | 140122123435125 |
7 | 12321052104413 |
oct | 1720675243735 |
9 | 415374621488 |
10 | 131113240541 |
11 | 50672008238 |
12 | 214b1685aa5 |
13 | c49671004a |
14 | 64bb2932b3 |
15 | 362596287b |
hex | 1e86f547dd |
131113240541 has 2 divisors, whose sum is σ = 131113240542. Its totient is φ = 131113240540.
The previous prime is 131113240513. The next prime is 131113240579. The reversal of 131113240541 is 145042311131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 99317001316 + 31796239225 = 315146^2 + 178315^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131113240541 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 131113240541.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131113210541) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65556620270 + 65556620271.
It is an arithmetic number, because the mean of its divisors is an integer number (65556620271).
Almost surely, 2131113240541 is an apocalyptic number.
It is an amenable number.
131113240541 is a deficient number, since it is larger than the sum of its proper divisors (1).
131113240541 is an equidigital number, since it uses as much as digits as its factorization.
131113240541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 26.
Adding to 131113240541 its reverse (145042311131), we get a palindrome (276155551672).
The spelling of 131113240541 in words is "one hundred thirty-one billion, one hundred thirteen million, two hundred forty thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •