Base | Representation |
---|---|
bin | 1111000010001… |
… | …0001111100000 |
3 | 11101122111221120 |
4 | 3300202033200 |
5 | 112120223231 |
6 | 10131252240 |
7 | 1363646166 |
oct | 360421740 |
9 | 141574846 |
10 | 63054816 |
11 | 32658020 |
12 | 1914a080 |
13 | 100a9556 |
14 | 8535236 |
15 | 5807d96 |
hex | 3c223e0 |
63054816 has 144 divisors (see below), whose sum is σ = 189641088. Its totient is φ = 18188800.
The previous prime is 63054793. The next prime is 63054821. The reversal of 63054816 is 61845036.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is an unprimeable number.
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 in 23 ways as a sum of consecutive naturals, for example, 888061 + ... + 888131.
It is an arithmetic number, because the mean of its divisors is an integer number (1316952).
Almost surely, 263054816 is an apocalyptic number.
63054816 is a gapful number since it is divisible by the number (66) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 63054816, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (94820544).
63054816 is an abundant number, since it is smaller than the sum of its proper divisors (126586272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
63054816 is a wasteful number, since it uses less digits than its factorization.
63054816 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153 (or 116 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 33.
The square root of 63054816 is about 7940.7062658179. The cubic root of 63054816 is about 398.0210926256.
The spelling of 63054816 in words is "sixty-three million, fifty-four thousand, eight hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •