Base | Representation |
---|---|
bin | 111101010100000… |
… | …100110001011101 |
3 | 2122200121222112101 |
4 | 331110010301131 |
5 | 4101320010410 |
6 | 250024005101 |
7 | 34330400332 |
oct | 7524046135 |
9 | 2580558471 |
10 | 1028672605 |
11 | 488727a54 |
12 | 248600791 |
13 | 135168c1c |
14 | 9a892989 |
15 | 60496d3a |
hex | 3d504c5d |
1028672605 has 8 divisors (see below), whose sum is σ = 1234762200. Its totient is φ = 822701376.
The previous prime is 1028672599. The next prime is 1028672609. The reversal of 1028672605 is 5062768201.
It is a happy number.
1028672605 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 30239001 + 998433604 = 5499^2 + 31598^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1028672605 - 29 = 1028672093 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1028672609) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9190 + ... + 46279.
It is an arithmetic number, because the mean of its divisors is an integer number (154345275).
Almost surely, 21028672605 is an apocalyptic number.
It is an amenable number.
1028672605 is a deficient number, since it is larger than the sum of its proper divisors (206089595).
1028672605 is an equidigital number, since it uses as much as digits as its factorization.
1028672605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59183.
The product of its (nonzero) digits is 40320, while the sum is 37.
The square root of 1028672605 is about 32072.9263554170. The cubic root of 1028672605 is about 1009.4676163614.
The spelling of 1028672605 in words is "one billion, twenty-eight million, six hundred seventy-two thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •