Base | Representation |
---|---|
bin | 111101001011000… |
… | …101011101100000 |
3 | 2122112012021001110 |
4 | 331023011131200 |
5 | 4100214104003 |
6 | 245501303320 |
7 | 34301354205 |
oct | 7513053540 |
9 | 2575167043 |
10 | 1026316128 |
11 | 487368552 |
12 | 247864b40 |
13 | 134822466 |
14 | 9a43bcac |
15 | 6017da03 |
hex | 3d2c5760 |
1026316128 has 24 divisors (see below), whose sum is σ = 2694080088. Its totient is φ = 342105344.
The previous prime is 1026316121. The next prime is 1026316133. The reversal of 1026316128 is 8216136201.
1026316128 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (24).
It is a junction number, because it is equal to n+sod(n) for n = 1026316095 and 1026316104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1026316121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5345301 + ... + 5345492.
It is an arithmetic number, because the mean of its divisors is an integer number (112253337).
Almost surely, 21026316128 is an apocalyptic number.
It is an amenable number.
1026316128 is an abundant number, since it is smaller than the sum of its proper divisors (1667763960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1026316128 is a wasteful number, since it uses less digits than its factorization.
1026316128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10690806 (or 10690798 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 30.
The square root of 1026316128 is about 32036.1690593616. The cubic root of 1026316128 is about 1008.6961995663.
The spelling of 1026316128 in words is "one billion, twenty-six million, three hundred sixteen thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •