Base | Representation |
---|---|
bin | 10010010010000… |
… | …01011010101001 |
3 | 101200120111102112 |
4 | 21021001122221 |
5 | 303230010131 |
6 | 23115012105 |
7 | 3541352552 |
oct | 1111013251 |
9 | 350514375 |
10 | 153360041 |
11 | 7962773a |
12 | 4343a035 |
13 | 25a073b3 |
14 | 16521329 |
15 | d6e502b |
hex | 92416a9 |
153360041 has 2 divisors, whose sum is σ = 153360042. Its totient is φ = 153360040.
The previous prime is 153360037. The next prime is 153360047. The reversal of 153360041 is 140063351.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 96040000 + 57320041 = 9800^2 + 7571^2 .
It is an emirp because it is prime and its reverse (140063351) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 153360041 - 22 = 153360037 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 153359989 and 153360016.
It is not a weakly prime, because it can be changed into another prime (153360047) 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, 76680020 + 76680021.
It is an arithmetic number, because the mean of its divisors is an integer number (76680021).
Almost surely, 2153360041 is an apocalyptic number.
It is an amenable number.
153360041 is a deficient number, since it is larger than the sum of its proper divisors (1).
153360041 is an equidigital number, since it uses as much as digits as its factorization.
153360041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 23.
The square root of 153360041 is about 12383.8621197105. The cubic root of 153360041 is about 535.2673319677.
The spelling of 153360041 in words is "one hundred fifty-three million, three hundred sixty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •