Base | Representation |
---|---|
bin | 10010010010000… |
… | …01001011101001 |
3 | 101200120110002222 |
4 | 21021001023221 |
5 | 303224442311 |
6 | 23115003425 |
7 | 3541350011 |
oct | 1111011351 |
9 | 350513088 |
10 | 153359081 |
11 | 79626a47 |
12 | 43439575 |
13 | 25a06b25 |
14 | 16520c41 |
15 | d6e4adb |
hex | 92412e9 |
153359081 has 2 divisors, whose sum is σ = 153359082. Its totient is φ = 153359080.
The previous prime is 153359053. The next prime is 153359119. The reversal of 153359081 is 180953351.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 137827600 + 15531481 = 11740^2 + 3941^2 .
It is a cyclic number.
It is not a de Polignac number, because 153359081 - 210 = 153358057 is a prime.
It is a super-2 number, since 2×1533590812 = 47038015450329122, which contains 22 as substring.
It is a Chen prime.
It is equal to p8622476 and since 153359081 and 8622476 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (153359281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 76679540 + 76679541.
It is an arithmetic number, because the mean of its divisors is an integer number (76679541).
Almost surely, 2153359081 is an apocalyptic number.
It is an amenable number.
153359081 is a deficient number, since it is larger than the sum of its proper divisors (1).
153359081 is an equidigital number, since it uses as much as digits as its factorization.
153359081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16200, while the sum is 35.
The square root of 153359081 is about 12383.8233595283. The cubic root of 153359081 is about 535.2662150802.
The spelling of 153359081 in words is "one hundred fifty-three million, three hundred fifty-nine thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •