Base | Representation |
---|---|
bin | 11001010110000… |
… | …111110101101000 |
3 | 1002122010220110010 |
4 | 121112013311220 |
5 | 1332324322142 |
6 | 110110051520 |
7 | 13352251440 |
oct | 3126076550 |
9 | 1078126403 |
10 | 425229672 |
11 | 1a903838a |
12 | ba4a9ba0 |
13 | 6a1361ba |
14 | 40691120 |
15 | 274e8e9c |
hex | 19587d68 |
425229672 has 64 divisors (see below), whose sum is σ = 1231620480. Its totient is φ = 119826432.
The previous prime is 425229647. The next prime is 425229683. The reversal of 425229672 is 276922524.
It is a self number, because there is not a number n which added to its sum of digits gives 425229672.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5073 + ... + 29600.
It is an arithmetic number, because the mean of its divisors is an integer number (19244070).
Almost surely, 2425229672 is an apocalyptic number.
425229672 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 425229672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (615810240).
425229672 is an abundant number, since it is smaller than the sum of its proper divisors (806390808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
425229672 is a wasteful number, since it uses less digits than its factorization.
425229672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34762 (or 34758 counting only the distinct ones).
The product of its digits is 120960, while the sum is 39.
The square root of 425229672 is about 20621.0977399362. The cubic root of 425229672 is about 751.9827076528.
The spelling of 425229672 in words is "four hundred twenty-five million, two hundred twenty-nine thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •