Base | Representation |
---|---|
bin | 110110000101101000… |
… | …1000110110100001011 |
3 | 102002210220122102100121 |
4 | 1230023101012310023 |
5 | 3400340201310411 |
6 | 125205433044111 |
7 | 11251245330262 |
oct | 1541321066413 |
9 | 362726572317 |
10 | 116153150731 |
11 | 45295475352 |
12 | 1a617556637 |
13 | ac512289b7 |
14 | 589c49b5d9 |
15 | 304c3d3571 |
hex | 1b0b446d0b |
116153150731 has 2 divisors, whose sum is σ = 116153150732. Its totient is φ = 116153150730.
The previous prime is 116153150717. The next prime is 116153150749. The reversal of 116153150731 is 137051351611.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 116153150731 - 29 = 116153150219 is a prime.
It is a super-2 number, since 2×1161531507312 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (116153153731) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58076575365 + 58076575366.
It is an arithmetic number, because the mean of its divisors is an integer number (58076575366).
Almost surely, 2116153150731 is an apocalyptic number.
116153150731 is a deficient number, since it is larger than the sum of its proper divisors (1).
116153150731 is an equidigital number, since it uses as much as digits as its factorization.
116153150731 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9450, while the sum is 34.
The spelling of 116153150731 in words is "one hundred sixteen billion, one hundred fifty-three million, one hundred fifty thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •