Base | Representation |
---|---|
bin | 111101111111110… |
… | …001001011000000 |
3 | 2200111011220112111 |
4 | 331333301023000 |
5 | 4112233023111 |
6 | 251113305104 |
7 | 34526634142 |
oct | 7577611300 |
9 | 2614156474 |
10 | 1040126656 |
11 | 494140608 |
12 | 250405194 |
13 | 13764957a |
14 | 9c1d4c92 |
15 | 614aaa21 |
hex | 3dff12c0 |
1040126656 has 56 divisors (see below), whose sum is σ = 2126837504. Its totient is φ = 504403200.
The previous prime is 1040126653. The next prime is 1040126669. The reversal of 1040126656 is 6566210401.
It is not an unprimeable number, because it can be changed into a prime (1040126653) 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, 414301 + ... + 416803.
Almost surely, 21040126656 is an apocalyptic number.
1040126656 is a gapful number since it is divisible by the number (16) 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 1040126656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1063418752).
1040126656 is an abundant number, since it is smaller than the sum of its proper divisors (1086710848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1040126656 is a wasteful number, since it uses less digits than its factorization.
1040126656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2709 (or 2699 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 31.
The square root of 1040126656 is about 32250.9946513282. The cubic root of 1040126656 is about 1013.2005312268.
The spelling of 1040126656 in words is "one billion, forty million, one hundred twenty-six thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •