Base | Representation |
---|---|
bin | 11001010111010… |
… | …001110001111000 |
3 | 1002122201021220022 |
4 | 121113101301320 |
5 | 1332414020121 |
6 | 110120350012 |
7 | 13354652432 |
oct | 3127216170 |
9 | 1078637808 |
10 | 425532536 |
11 | 1a9224990 |
12 | ba615308 |
13 | 6a211000 |
14 | 4072d652 |
15 | 27558aab |
hex | 195d1c78 |
425532536 has 128 divisors (see below), whose sum is σ = 987033600. Its totient is φ = 170352000.
The previous prime is 425532521. The next prime is 425532551. The reversal of 425532536 is 635235524.
It is an interprime number because it is at equal distance from previous prime (425532521) and next prime (425532551).
It is a junction number, because it is equal to n+sod(n) for n = 425532496 and 425532505.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5993381 + ... + 5993451.
It is an arithmetic number, because the mean of its divisors is an integer number (7711200).
Almost surely, 2425532536 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 425532536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (493516800).
425532536 is an abundant number, since it is smaller than the sum of its proper divisors (561501064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
425532536 is a wasteful number, since it uses less digits than its factorization.
425532536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158 (or 128 counting only the distinct ones).
The product of its digits is 108000, while the sum is 35.
The square root of 425532536 is about 20628.4399797949. The cubic root of 425532536 is about 752.1611950733.
The spelling of 425532536 in words is "four hundred twenty-five million, five hundred thirty-two thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •