Base | Representation |
---|---|
bin | 100001101000110… |
… | …1001110001100100 |
3 | 2220122211221201210 |
4 | 1003101221301210 |
5 | 4302421413103 |
6 | 303555551420 |
7 | 36653541360 |
oct | 10321516144 |
9 | 2818757653 |
10 | 1128701028 |
11 | 52a138874 |
12 | 275bbb570 |
13 | 14cabc640 |
14 | a9c902a0 |
15 | 69154e03 |
hex | 43469c64 |
1128701028 has 96 divisors (see below), whose sum is σ = 3289990144. Its totient is φ = 293217408.
The previous prime is 1128700997. The next prime is 1128701051. The reversal of 1128701028 is 8201078211.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 1128700986 and 1128701004.
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 31 ways as a sum of consecutive naturals, for example, 65451 + ... + 80877.
Almost surely, 21128701028 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1128701028, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1644995072).
1128701028 is an abundant number, since it is smaller than the sum of its proper divisors (2161289116).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1128701028 is a wasteful number, since it uses less digits than its factorization.
1128701028 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15521 (or 15519 counting only the distinct ones).
The product of its (nonzero) digits is 1792, while the sum is 30.
The square root of 1128701028 is about 33596.1460289718. The cubic root of 1128701028 is about 1041.1811740062.
Adding to 1128701028 its reverse (8201078211), we get a palindrome (9329779239).
The spelling of 1128701028 in words is "one billion, one hundred twenty-eight million, seven hundred one thousand, twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •