Base | Representation |
---|---|
bin | 11001010111110… |
… | …101100011100000 |
3 | 1002122222201220120 |
4 | 121113311203200 |
5 | 1332433212242 |
6 | 110123440240 |
7 | 13356132600 |
oct | 3127654340 |
9 | 1078881816 |
10 | 425679072 |
11 | 1a9314a95 |
12 | ba686080 |
13 | 6a262910 |
14 | 4076ac00 |
15 | 275871ec |
hex | 195f58e0 |
425679072 has 144 divisors (see below), whose sum is σ = 1400030352. Its totient is φ = 112250880.
The previous prime is 425679053. The next prime is 425679083. The reversal of 425679072 is 270976524.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
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, 57672 + ... + 64632.
It is an arithmetic number, because the mean of its divisors is an integer number (9722433).
Almost surely, 2425679072 is an apocalyptic number.
425679072 is a gapful number since it is divisible by the number (42) 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 425679072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (700015176).
425679072 is an abundant number, since it is smaller than the sum of its proper divisors (974351280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
425679072 is a wasteful number, since it uses less digits than its factorization.
425679072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7001 (or 6986 counting only the distinct ones).
The product of its (nonzero) digits is 211680, while the sum is 42.
The square root of 425679072 is about 20631.9914695601. The cubic root of 425679072 is about 752.2475230149.
The spelling of 425679072 in words is "four hundred twenty-five million, six hundred seventy-nine thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •