Base | Representation |
---|---|
bin | 111101001100101… |
… | …101100110000000 |
3 | 2122112222221010210 |
4 | 331030231212000 |
5 | 4100321231111 |
6 | 245514354120 |
7 | 34305111552 |
oct | 7514554600 |
9 | 2575887123 |
10 | 1026742656 |
11 | 487629a55 |
12 | 247a2b940 |
13 | 134941644 |
14 | 9a50d4d2 |
15 | 602150a6 |
hex | 3d32d980 |
1026742656 has 64 divisors (see below), whose sum is σ = 2741760000. Its totient is φ = 340431360.
The previous prime is 1026742643. The next prime is 1026742679. The reversal of 1026742656 is 6562476201.
It is a tau number, because it is divible by the number of its divisors (64).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 66345 + ... + 80343.
It is an arithmetic number, because the mean of its divisors is an integer number (42840000).
Almost surely, 21026742656 is an apocalyptic number.
1026742656 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 1026742656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1370880000).
1026742656 is an abundant number, since it is smaller than the sum of its proper divisors (1715017344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1026742656 is a wasteful number, since it uses less digits than its factorization.
1026742656 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14207 (or 14195 counting only the distinct ones).
The product of its (nonzero) digits is 120960, while the sum is 39.
The square root of 1026742656 is about 32042.8253435929. The cubic root of 1026742656 is about 1008.8359153172.
The spelling of 1026742656 in words is "one billion, twenty-six million, seven hundred forty-two thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •