Base | Representation |
---|---|
bin | 111101100000111… |
… | …010111100111000 |
3 | 2122220222002001220 |
4 | 331200322330320 |
5 | 4103200241443 |
6 | 250224112040 |
7 | 34401124461 |
oct | 7540727470 |
9 | 2586862056 |
10 | 1032040248 |
11 | 48a618128 |
12 | 249765620 |
13 | 135a77a05 |
14 | 9b0cbd68 |
15 | 6090ea83 |
hex | 3d83af38 |
1032040248 has 32 divisors (see below), whose sum is σ = 2640105600. Its totient is φ = 336012768.
The previous prime is 1032040211. The next prime is 1032040249. The reversal of 1032040248 is 8420402301.
It is a Harshad number since it is a multiple of its sum of digits (24).
1032040248 is a modest number, since divided by 40248 gives 1032 as remainder.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1032040249) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 498988 + ... + 501051.
It is an arithmetic number, because the mean of its divisors is an integer number (82503300).
Almost surely, 21032040248 is an apocalyptic number.
It is an amenable number.
1032040248 is an abundant number, since it is smaller than the sum of its proper divisors (1608065352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1032040248 is a wasteful number, since it uses less digits than its factorization.
1032040248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1000091 (or 1000087 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 24.
The square root of 1032040248 is about 32125.3832350682. The cubic root of 1032040248 is about 1010.5680064842.
Adding to 1032040248 its reverse (8420402301), we get a palindrome (9452442549).
The spelling of 1032040248 in words is "one billion, thirty-two million, forty thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •