Base | Representation |
---|---|
bin | 1111000111000… |
… | …0000001110100 |
3 | 11102020201000000 |
4 | 3301300001310 |
5 | 112210422203 |
6 | 10142151300 |
7 | 1366444116 |
oct | 361600164 |
9 | 142221000 |
10 | 63373428 |
11 | 32855438 |
12 | 19282530 |
13 | 1018b591 |
14 | 85b93b6 |
15 | 586c4a3 |
hex | 3c70074 |
63373428 has 84 divisors (see below), whose sum is σ = 168689248. Its totient is φ = 20820240.
The previous prime is 63373411. The next prime is 63373463. The reversal of 63373428 is 82437336.
It is a Harshad number since it is a multiple of its sum of digits (36).
Its product of digits (72576) is a multiple of the sum of its prime factors (336).
It is a junction number, because it is equal to n+sod(n) for n = 63373392 and 63373401.
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 27 ways as a sum of consecutive naturals, for example, 300243 + ... + 300453.
Almost surely, 263373428 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 63373428, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (84344624).
63373428 is an abundant number, since it is smaller than the sum of its proper divisors (105315820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
63373428 is a wasteful number, since it uses less digits than its factorization.
63373428 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 336 (or 319 counting only the distinct ones).
The product of its digits is 72576, while the sum is 36.
The square root of 63373428 is about 7960.7429301542. The cubic root of 63373428 is about 398.6903584438.
The spelling of 63373428 in words is "sixty-three million, three hundred seventy-three thousand, four hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •