Base | Representation |
---|---|
bin | 1000111011010011111… |
… | …0011110010111001011 |
3 | 112122211221010212210112 |
4 | 2032310332132113023 |
5 | 10003040143202111 |
6 | 154241435504535 |
7 | 14036256416045 |
oct | 2166476362713 |
9 | 478757125715 |
10 | 153360131531 |
11 | 5a048883762 |
12 | 2587bbb814b |
13 | 11600756579 |
14 | 75cbb40a95 |
15 | 3ec8aade8b |
hex | 23b4f9e5cb |
153360131531 has 2 divisors, whose sum is σ = 153360131532. Its totient is φ = 153360131530.
The previous prime is 153360131471. The next prime is 153360131569. The reversal of 153360131531 is 135131063351.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 153360131531 - 26 = 153360131467 is a prime.
It is a super-2 number, since 2×1533601315312 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (153360131731) 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, 76680065765 + 76680065766.
It is an arithmetic number, because the mean of its divisors is an integer number (76680065766).
Almost surely, 2153360131531 is an apocalyptic number.
153360131531 is a deficient number, since it is larger than the sum of its proper divisors (1).
153360131531 is an equidigital number, since it uses as much as digits as its factorization.
153360131531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12150, while the sum is 32.
Adding to 153360131531 its reverse (135131063351), we get a palindrome (288491194882).
The spelling of 153360131531 in words is "one hundred fifty-three billion, three hundred sixty million, one hundred thirty-one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •