Base | Representation |
---|---|
bin | 111110000111001… |
… | …101001101000000 |
3 | 2200121211222012012 |
4 | 332013031031000 |
5 | 4113232421410 |
6 | 251223152052 |
7 | 34552334564 |
oct | 7607151500 |
9 | 2617758165 |
10 | 1042076480 |
11 | 495252535 |
12 | 250ba5628 |
13 | 137b7cc03 |
14 | 9c5816a4 |
15 | 61743605 |
hex | 3e1cd340 |
1042076480 has 112 divisors (see below), whose sum is σ = 2554467840. Its totient is φ = 404717568.
The previous prime is 1042076471. The next prime is 1042076509. The reversal of 1042076480 is 846702401.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
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, 2902541 + ... + 2902899.
Almost surely, 21042076480 is an apocalyptic number.
1042076480 is a gapful number since it is divisible by the number (10) 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 1042076480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1277233920).
1042076480 is an abundant number, since it is smaller than the sum of its proper divisors (1512391360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1042076480 is a wasteful number, since it uses less digits than its factorization.
1042076480 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 616 (or 606 counting only the distinct ones).
The product of its (nonzero) digits is 10752, while the sum is 32.
The square root of 1042076480 is about 32281.2093949406. The cubic root of 1042076480 is about 1013.8332520979.
Adding to 1042076480 its reverse (846702401), we get a palindrome (1888778881).
The spelling of 1042076480 in words is "one billion, forty-two million, seventy-six thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •