Base | Representation |
---|---|
bin | 1000111100011100001… |
… | …0000100010010111110 |
3 | 112200122001011101222002 |
4 | 2033013002010102332 |
5 | 10004200221010410 |
6 | 154331500422302 |
7 | 14046625325615 |
oct | 2170702042276 |
9 | 480561141862 |
10 | 153663063230 |
11 | 5a19387a836 |
12 | 25945547992 |
13 | 1164b43c8b1 |
14 | 761a07887c |
15 | 3ee549b7a5 |
hex | 23c70844be |
153663063230 has 16 divisors (see below), whose sum is σ = 283025921904. Its totient is φ = 60035801280.
The previous prime is 153663063139. The next prime is 153663063233. The reversal of 153663063230 is 32360366351.
153663063230 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×1536630632302 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (153663063233) 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 in 7 ways as a sum of consecutive naturals, for example, 178677551 + ... + 178678410.
It is an arithmetic number, because the mean of its divisors is an integer number (17689120119).
Almost surely, 2153663063230 is an apocalyptic number.
153663063230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
153663063230 is a deficient number, since it is larger than the sum of its proper divisors (129362858674).
153663063230 is a wasteful number, since it uses less digits than its factorization.
153663063230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 357356011.
The product of its (nonzero) digits is 174960, while the sum is 38.
The spelling of 153663063230 in words is "one hundred fifty-three billion, six hundred sixty-three million, sixty-three thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •