Base | Representation |
---|---|
bin | 11001100011100… |
… | …110011000000000 |
3 | 1002212210101202012 |
4 | 121203212120000 |
5 | 1334230400444 |
6 | 110313512052 |
7 | 13424264543 |
oct | 3143463000 |
9 | 1085711665 |
10 | 428762624 |
11 | 200030784 |
12 | bb712628 |
13 | 6aaa22c4 |
14 | 40d3085a |
15 | 27995b9e |
hex | 198e6600 |
428762624 has 40 divisors (see below), whose sum is σ = 861325080. Its totient is φ = 213221376.
The previous prime is 428762599. The next prime is 428762629. The reversal of 428762624 is 426267824.
It is a zygodrome in base 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (428762629) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 96647 + ... + 100985.
It is an arithmetic number, because the mean of its divisors is an integer number (21533127).
Almost surely, 2428762624 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 428762624, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (430662540).
428762624 is an abundant number, since it is smaller than the sum of its proper divisors (432562456).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
428762624 is an equidigital number, since it uses as much as digits as its factorization.
428762624 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4550 (or 4534 counting only the distinct ones).
The product of its digits is 258048, while the sum is 41.
The square root of 428762624 is about 20706.5840736709. The cubic root of 428762624 is about 754.0595421415.
The spelling of 428762624 in words is "four hundred twenty-eight million, seven hundred sixty-two thousand, six hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •