Base | Representation |
---|---|
bin | 111110000010011… |
… | …100001011001000 |
3 | 2200112111111100010 |
4 | 332002130023020 |
5 | 4112422431310 |
6 | 251140311520 |
7 | 34535612166 |
oct | 7602341310 |
9 | 2615444303 |
10 | 1040827080 |
11 | 494579877 |
12 | 2506a25a0 |
13 | 137833317 |
14 | 9c338236 |
15 | 61598320 |
hex | 3e09c2c8 |
1040827080 has 64 divisors (see below), whose sum is σ = 3125485440. Its totient is φ = 277286912.
The previous prime is 1040827069. The next prime is 1040827093. The reversal of 1040827080 is 807280401.
It is a super-3 number, since 3×10408270803 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 142477 + ... + 149603.
It is an arithmetic number, because the mean of its divisors is an integer number (48835710).
Almost surely, 21040827080 is an apocalyptic number.
1040827080 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1040827080 is an abundant number, since it is smaller than the sum of its proper divisors (2084658360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1040827080 is a wasteful number, since it uses less digits than its factorization.
1040827080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8358 (or 8354 counting only the distinct ones).
The product of its (nonzero) digits is 3584, while the sum is 30.
The square root of 1040827080 is about 32261.8517757428. The cubic root of 1040827080 is about 1013.4279108209.
The spelling of 1040827080 in words is "one billion, forty million, eight hundred twenty-seven thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •