Base | Representation |
---|---|
bin | 1111001010111… |
… | …0010110100000 |
3 | 11102201200011200 |
4 | 3302232112200 |
5 | 112242104304 |
6 | 10151441200 |
7 | 1401556266 |
oct | 362562640 |
9 | 142650150 |
10 | 63628704 |
11 | 32a0a207 |
12 | 19386200 |
13 | 1024a829 |
14 | 8644436 |
15 | 58bce39 |
hex | 3cae5a0 |
63628704 has 36 divisors (see below), whose sum is σ = 180944946. Its totient is φ = 21209472.
The previous prime is 63628699. The next prime is 63628711. The reversal of 63628704 is 40782636.
63628704 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 56972304 + 6656400 = 7548^2 + 2580^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-2 number, since 2×636287042 = 8097223945439232, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 110179 + ... + 110754.
Almost surely, 263628704 is an apocalyptic number.
It is an amenable number.
63628704 is an abundant number, since it is smaller than the sum of its proper divisors (117316242).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
63628704 is a wasteful number, since it uses less digits than its factorization.
63628704 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 220949 (or 220938 counting only the distinct ones).
The product of its (nonzero) digits is 48384, while the sum is 36.
The square root of 63628704 is about 7976.7602446106. The cubic root of 63628704 is about 399.2249659421.
The spelling of 63628704 in words is "sixty-three million, six hundred twenty-eight thousand, seven hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •