Base | Representation |
---|---|
bin | 10010010100010… |
… | …11011010110000 |
3 | 101201010220012212 |
4 | 21022023122300 |
5 | 303314210102 |
6 | 23125311252 |
7 | 3544054346 |
oct | 1112133260 |
9 | 351126185 |
10 | 153663152 |
11 | 79814445 |
12 | 43565528 |
13 | 25ab2356 |
14 | 1659d996 |
15 | d754c52 |
hex | 928b6b0 |
153663152 has 20 divisors (see below), whose sum is σ = 299239776. Its totient is φ = 76440000.
The previous prime is 153663151. The next prime is 153663157. The reversal of 153663152 is 251366351.
153663152 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1536631522 = 47224728565150208, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (153663151) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21224 + ... + 27527.
Almost surely, 2153663152 is an apocalyptic number.
It is an amenable number.
153663152 is a deficient number, since it is larger than the sum of its proper divisors (145576624).
153663152 is a wasteful number, since it uses less digits than its factorization.
153663152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48956 (or 48950 counting only the distinct ones).
The product of its digits is 16200, while the sum is 32.
The square root of 153663152 is about 12396.0942235851. The cubic root of 153663152 is about 535.6197458941.
The spelling of 153663152 in words is "one hundred fifty-three million, six hundred sixty-three thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •