Base | Representation |
---|---|
bin | 111110011111011… |
… | …100110011010001 |
3 | 2201001210212002100 |
4 | 332133130303101 |
5 | 4121344304300 |
6 | 252011311013 |
7 | 34660344360 |
oct | 7637346321 |
9 | 2631725070 |
10 | 1048431825 |
11 | 4988a3391 |
12 | 25314b469 |
13 | 13929687c |
14 | 9d3577d7 |
15 | 6209b700 |
hex | 3e7dccd1 |
1048431825 has 72 divisors (see below), whose sum is σ = 2162014400. Its totient is φ = 475735680.
The previous prime is 1048431823. The next prime is 1048431841. The reversal of 1048431825 is 5281348401.
It is not a de Polignac number, because 1048431825 - 21 = 1048431823 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1048431825.
It is not an unprimeable number, because it can be changed into a prime (1048431823) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 216531 + ... + 221319.
Almost surely, 21048431825 is an apocalyptic number.
1048431825 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1048431825 is an abundant number, since it is smaller than the sum of its proper divisors (1113582575).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1048431825 is a wasteful number, since it uses less digits than its factorization.
1048431825 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4951 (or 4943 counting only the distinct ones).
The product of its (nonzero) digits is 30720, while the sum is 36.
The square root of 1048431825 is about 32379.4969849749. The cubic root of 1048431825 is about 1015.8901087177.
The spelling of 1048431825 in words is "one billion, forty-eight million, four hundred thirty-one thousand, eight hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •