Base | Representation |
---|---|
bin | 11001011010000… |
… | …010000010111000 |
3 | 1002201001222021110 |
4 | 121122002002320 |
5 | 1333110121040 |
6 | 110144040320 |
7 | 13364050356 |
oct | 3132020270 |
9 | 1081058243 |
10 | 426254520 |
11 | 1a967836a |
12 | ba9030a0 |
13 | 6a404813 |
14 | 4087a7d6 |
15 | 2764c980 |
hex | 196820b8 |
426254520 has 64 divisors (see below), whose sum is σ = 1283415840. Its totient is φ = 113254400.
The previous prime is 426254503. The next prime is 426254593. The reversal of 426254520 is 25452624.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (30).
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 15 ways as a sum of consecutive naturals, for example, 27400 + ... + 40040.
Almost surely, 2426254520 is an apocalyptic number.
426254520 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 426254520, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (641707920).
426254520 is an abundant number, since it is smaller than the sum of its proper divisors (857161320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
426254520 is a wasteful number, since it uses less digits than its factorization.
426254520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12936 (or 12932 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 30.
The square root of 426254520 is about 20645.9322870148. The cubic root of 426254520 is about 752.5863419726.
The spelling of 426254520 in words is "four hundred twenty-six million, two hundred fifty-four thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •