Base | Representation |
---|---|
bin | 1111000001011… |
… | …0011111101000 |
3 | 11101120001221100 |
4 | 3300112133220 |
5 | 112112203241 |
6 | 10130241400 |
7 | 1363355664 |
oct | 360263750 |
9 | 141501840 |
10 | 63006696 |
11 | 32624955 |
12 | 19126260 |
13 | 1009068c |
14 | 85218a4 |
15 | 57e89b6 |
hex | 3c167e8 |
63006696 has 96 divisors (see below), whose sum is σ = 178738560. Its totient is φ = 20030976.
The previous prime is 63006673. The next prime is 63006701. The reversal of 63006696 is 69660036.
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 63006696.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 145296 + ... + 145728.
It is an arithmetic number, because the mean of its divisors is an integer number (1861860).
Almost surely, 263006696 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 63006696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (89369280).
63006696 is an abundant number, since it is smaller than the sum of its proper divisors (115731864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
63006696 is a wasteful number, since it uses less digits than its factorization.
63006696 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 535 (or 528 counting only the distinct ones).
The product of its (nonzero) digits is 34992, while the sum is 36.
The square root of 63006696 is about 7937.6757303382. The cubic root of 63006696 is about 397.9198175215.
It can be divided in two parts, 6300 and 6696, that added together give a square (12996 = 1142).
The spelling of 63006696 in words is "sixty-three million, six thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •