Base | Representation |
---|---|
bin | 11001011011000… |
… | …000000100111000 |
3 | 1002201112212210211 |
4 | 121123000010320 |
5 | 1333141233400 |
6 | 110153320504 |
7 | 13366156210 |
oct | 3133000470 |
9 | 1081485724 |
10 | 426508600 |
11 | 1a9831251 |
12 | baa06134 |
13 | 6a49336b |
14 | 40905240 |
15 | 2769cdba |
hex | 196c0138 |
426508600 has 96 divisors (see below), whose sum is σ = 1150462080. Its totient is φ = 144017280.
The previous prime is 426508519. The next prime is 426508627. The reversal of 426508600 is 6805624.
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 23 ways as a sum of consecutive naturals, for example, 91527 + ... + 96073.
It is an arithmetic number, because the mean of its divisors is an integer number (11983980).
Almost surely, 2426508600 is an apocalyptic number.
426508600 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 426508600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (575231040).
426508600 is an abundant number, since it is smaller than the sum of its proper divisors (723953480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
426508600 is a wasteful number, since it uses less digits than its factorization.
426508600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4637 (or 4628 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 31.
The square root of 426508600 is about 20652.0846405393. The cubic root of 426508600 is about 752.7358451044.
The spelling of 426508600 in words is "four hundred twenty-six million, five hundred eight thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •