Base | Representation |
---|---|
bin | 1111000101100… |
… | …0100000000000 |
3 | 11102001210210200 |
4 | 3301120200000 |
5 | 112144331211 |
6 | 10140125200 |
7 | 1365563133 |
oct | 361304000 |
9 | 142053720 |
10 | 63277056 |
11 | 32799a97 |
12 | 19236800 |
13 | 1015675b |
14 | 859221a |
15 | 584db56 |
hex | 3c58800 |
63277056 has 72 divisors (see below), whose sum is σ = 182808990. Its totient is φ = 21086208.
The previous prime is 63277031. The next prime is 63277073. The reversal of 63277056 is 65077236.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 57517056 + 5760000 = 7584^2 + 2400^2 .
It is a tau number, because it is divible by the number of its divisors (72).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 63277056.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 16716 + ... + 20148.
Almost surely, 263277056 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 63277056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (91404495).
63277056 is an abundant number, since it is smaller than the sum of its proper divisors (119531934).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
63277056 is a wasteful number, since it uses less digits than its factorization.
63277056 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3461 (or 3438 counting only the distinct ones).
The product of its (nonzero) digits is 52920, while the sum is 36.
The square root of 63277056 is about 7954.6876745728. The cubic root of 63277056 is about 398.4881597131.
The spelling of 63277056 in words is "sixty-three million, two hundred seventy-seven thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •