Base | Representation |
---|---|
bin | 111101000110100001… |
… | …1101000110100110011 |
3 | 110112200122020002110002 |
4 | 1322031003220310303 |
5 | 4122212140404422 |
6 | 140140220500215 |
7 | 12323433600011 |
oct | 1721503506463 |
9 | 415618202402 |
10 | 131215559987 |
11 | 50714843366 |
12 | 2151b9aa66b |
13 | c4b19864b5 |
14 | 64caac98b1 |
15 | 362e924692 |
hex | 1e8d0e8d33 |
131215559987 has 2 divisors, whose sum is σ = 131215559988. Its totient is φ = 131215559986.
The previous prime is 131215559983. The next prime is 131215560017. The reversal of 131215559987 is 789955512131.
It is a weak prime.
It is an emirp because it is prime and its reverse (789955512131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 131215559987 - 22 = 131215559983 is a prime.
It is not a weakly prime, because it can be changed into another prime (131215559983) 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, 65607779993 + 65607779994.
It is an arithmetic number, because the mean of its divisors is an integer number (65607779994).
Almost surely, 2131215559987 is an apocalyptic number.
131215559987 is a deficient number, since it is larger than the sum of its proper divisors (1).
131215559987 is an equidigital number, since it uses as much as digits as its factorization.
131215559987 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3402000, while the sum is 56.
The spelling of 131215559987 in words is "one hundred thirty-one billion, two hundred fifteen million, five hundred fifty-nine thousand, nine hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •