Base | Representation |
---|---|
bin | 100000001000100… |
… | …1111000101000000 |
3 | 2210010221021200202 |
4 | 1000101033011000 |
5 | 4202013310112 |
6 | 254554504332 |
7 | 35502026153 |
oct | 10021170500 |
9 | 2703837622 |
10 | 1078260032 |
11 | 5037167a3 |
12 | 2611350a8 |
13 | 14250b5b5 |
14 | a32bdc9a |
15 | 649de6c2 |
hex | 4044f140 |
1078260032 has 56 divisors (see below), whose sum is σ = 2274417600. Its totient is φ = 505737216.
The previous prime is 1078260023. The next prime is 1078260061. The reversal of 1078260032 is 2300628701.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 1078259977 and 1078260004.
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, 120944 + ... + 129552.
It is an arithmetic number, because the mean of its divisors is an integer number (40614600).
Almost surely, 21078260032 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 1078260032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1137208800).
1078260032 is an abundant number, since it is smaller than the sum of its proper divisors (1196157568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1078260032 is a wasteful number, since it uses less digits than its factorization.
1078260032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8743 (or 8733 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 29.
The square root of 1078260032 is about 32836.8700091833. The cubic root of 1078260032 is about 1025.4342897322.
Adding to 1078260032 its reverse (2300628701), we get a palindrome (3378888733).
The spelling of 1078260032 in words is "one billion, seventy-eight million, two hundred sixty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •