Base | Representation |
---|---|
bin | 10010001111100… |
… | …01111110111001 |
3 | 101122221222010011 |
4 | 21013301332321 |
5 | 303134102211 |
6 | 23104021521 |
7 | 3535526152 |
oct | 1107617671 |
9 | 348858104 |
10 | 153034681 |
11 | 79425248 |
12 | 433018a1 |
13 | 25922287 |
14 | 16478929 |
15 | d67d921 |
hex | 91f1fb9 |
153034681 has 2 divisors, whose sum is σ = 153034682. Its totient is φ = 153034680.
The previous prime is 153034667. The next prime is 153034723. The reversal of 153034681 is 186430351.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 110250000 + 42784681 = 10500^2 + 6541^2 .
It is an emirp because it is prime and its reverse (186430351) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 153034681 - 29 = 153034169 is a prime.
It is a super-2 number, since 2×1530346812 = 46839227177543522, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (153034601) 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, 76517340 + 76517341.
It is an arithmetic number, because the mean of its divisors is an integer number (76517341).
Almost surely, 2153034681 is an apocalyptic number.
It is an amenable number.
153034681 is a deficient number, since it is larger than the sum of its proper divisors (1).
153034681 is an equidigital number, since it uses as much as digits as its factorization.
153034681 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8640, while the sum is 31.
The square root of 153034681 is about 12370.7186937542. The cubic root of 153034681 is about 534.8885329833. Note that the first 3 decimals are identical.
The spelling of 153034681 in words is "one hundred fifty-three million, thirty-four thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.150 sec. • engine limits •