Base | Representation |
---|---|
bin | 1000111100110000101… |
… | …1110101101111011011 |
3 | 112200212001211102012012 |
4 | 2033030023311233123 |
5 | 10004334333324011 |
6 | 154344225340135 |
7 | 14052025165406 |
oct | 2171413655733 |
9 | 480761742165 |
10 | 153749511131 |
11 | 5a228655387 |
12 | 2596a49764b |
13 | 11663319ab8 |
14 | 762773cd3d |
15 | 3eecd75a8b |
hex | 23cc2f5bdb |
153749511131 has 2 divisors, whose sum is σ = 153749511132. Its totient is φ = 153749511130.
The previous prime is 153749511109. The next prime is 153749511143. The reversal of 153749511131 is 131115947351.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (131115947351) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 153749511131 - 218 = 153749248987 is a prime.
It is a super-2 number, since 2×1537495111312 (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 (153749511101) 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, 76874755565 + 76874755566.
It is an arithmetic number, because the mean of its divisors is an integer number (76874755566).
Almost surely, 2153749511131 is an apocalyptic number.
153749511131 is a deficient number, since it is larger than the sum of its proper divisors (1).
153749511131 is an equidigital number, since it uses as much as digits as its factorization.
153749511131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 56700, while the sum is 41.
The spelling of 153749511131 in words is "one hundred fifty-three billion, seven hundred forty-nine million, five hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •