Base | Representation |
---|---|
bin | 111101010000001011… |
… | …1011111011010111011 |
3 | 110120112012211112202012 |
4 | 1322200113133122323 |
5 | 4123343110001301 |
6 | 140232312400135 |
7 | 12334446366146 |
oct | 1724027373273 |
9 | 416465745665 |
10 | 131539531451 |
11 | 508706aa979 |
12 | 215b03a604b |
13 | c533b282a3 |
14 | 651bb3d05d |
15 | 364d0baebb |
hex | 1ea05df6bb |
131539531451 has 2 divisors, whose sum is σ = 131539531452. Its totient is φ = 131539531450.
The previous prime is 131539531441. The next prime is 131539531469. The reversal of 131539531451 is 154135935131.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 131539531451 - 230 = 130465789627 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 131539531399 and 131539531408.
It is not a weakly prime, because it can be changed into another prime (131539531411) 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, 65769765725 + 65769765726.
It is an arithmetic number, because the mean of its divisors is an integer number (65769765726).
Almost surely, 2131539531451 is an apocalyptic number.
131539531451 is a deficient number, since it is larger than the sum of its proper divisors (1).
131539531451 is an equidigital number, since it uses as much as digits as its factorization.
131539531451 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 121500, while the sum is 41.
The spelling of 131539531451 in words is "one hundred thirty-one billion, five hundred thirty-nine million, five hundred thirty-one thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •