Base | Representation |
---|---|
bin | 111101000100011001… |
… | …1001111010110111111 |
3 | 110112111122212012210202 |
4 | 1322020303033112333 |
5 | 4122040400340021 |
6 | 140125150154115 |
7 | 12321605621651 |
oct | 1721063172677 |
9 | 415448765722 |
10 | 131144152511 |
11 | 50688500919 |
12 | 214bbab293b |
13 | c49cc44158 |
14 | 64c141c6d1 |
15 | 362851ba0b |
hex | 1e88ccf5bf |
131144152511 has 2 divisors, whose sum is σ = 131144152512. Its totient is φ = 131144152510.
The previous prime is 131144152501. The next prime is 131144152519. The reversal of 131144152511 is 115251441131.
It is a strong prime.
It is an emirp because it is prime and its reverse (115251441131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 131144152511 - 210 = 131144151487 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131144152519) 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, 65572076255 + 65572076256.
It is an arithmetic number, because the mean of its divisors is an integer number (65572076256).
Almost surely, 2131144152511 is an apocalyptic number.
131144152511 is a deficient number, since it is larger than the sum of its proper divisors (1).
131144152511 is an equidigital number, since it uses as much as digits as its factorization.
131144152511 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2400, while the sum is 29.
Adding to 131144152511 its reverse (115251441131), we get a palindrome (246395593642).
The spelling of 131144152511 in words is "one hundred thirty-one billion, one hundred forty-four million, one hundred fifty-two thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •