Base | Representation |
---|---|
bin | 111101100001010… |
… | …100000000000000 |
3 | 2122221011021210220 |
4 | 331201110000000 |
5 | 4103212032343 |
6 | 250230223040 |
7 | 34402032552 |
oct | 7541240000 |
9 | 2587137726 |
10 | 1032142848 |
11 | 48a688220 |
12 | 2497b4a80 |
13 | 135ab2619 |
14 | 9b1174d2 |
15 | 60930183 |
hex | 3d854000 |
1032142848 has 240 divisors, whose sum is σ = 3170797056. Its totient is φ = 295567360.
The previous prime is 1032142841. The next prime is 1032142849. The reversal of 1032142848 is 8482412301.
It is a super-2 number, since 2×10321428482 = 2130637717355102208, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1032142841) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12435415 + ... + 12435497.
Almost surely, 21032142848 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 1032142848, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1585398528).
1032142848 is an abundant number, since it is smaller than the sum of its proper divisors (2138654208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1032142848 is an equidigital number, since it uses as much as digits as its factorization.
1032142848 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148 (or 122 counting only the distinct ones).
The product of its (nonzero) digits is 12288, while the sum is 33.
The square root of 1032142848 is about 32126.9800634918. The cubic root of 1032142848 is about 1010.6014938222.
The spelling of 1032142848 in words is "one billion, thirty-two million, one hundred forty-two thousand, eight hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •