Base | Representation |
---|---|
bin | 10010010010000… |
… | …10111000011001 |
3 | 101200120210122202 |
4 | 21021002320121 |
5 | 303230203131 |
6 | 23115055545 |
7 | 3541406213 |
oct | 1111027031 |
9 | 350523582 |
10 | 153366041 |
11 | 796311a4 |
12 | 434415b5 |
13 | 25a0a04a |
14 | 165235b3 |
15 | d6e6bcb |
hex | 9242e19 |
153366041 has 2 divisors, whose sum is σ = 153366042. Its totient is φ = 153366040.
The previous prime is 153366013. The next prime is 153366049. The reversal of 153366041 is 140663351.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 135047641 + 18318400 = 11621^2 + 4280^2 .
It is a cyclic number.
It is not a de Polignac number, because 153366041 - 26 = 153365977 is a prime.
It is a super-2 number, since 2×1533660412 = 47042285064027362, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 153365995 and 153366013.
It is not a weakly prime, because it can be changed into another prime (153366049) 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, 76683020 + 76683021.
It is an arithmetic number, because the mean of its divisors is an integer number (76683021).
Almost surely, 2153366041 is an apocalyptic number.
It is an amenable number.
153366041 is a deficient number, since it is larger than the sum of its proper divisors (1).
153366041 is an equidigital number, since it uses as much as digits as its factorization.
153366041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 29.
The square root of 153366041 is about 12384.1043681003. The cubic root of 153366041 is about 535.2743124086.
The spelling of 153366041 in words is "one hundred fifty-three million, three hundred sixty-six thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.144 sec. • engine limits •