Base | Representation |
---|---|
bin | 111101010010110… |
… | …001010001100101 |
3 | 2122122222121101102 |
4 | 331102301101211 |
5 | 4101223034342 |
6 | 250012405445 |
7 | 34324444250 |
oct | 7522612145 |
9 | 2578877342 |
10 | 1028330597 |
11 | 488513aa8 |
12 | 248476885 |
13 | 135079358 |
14 | 9a804097 |
15 | 6042a832 |
hex | 3d4b1465 |
1028330597 has 16 divisors (see below), whose sum is σ = 1252761600. Its totient is φ = 824456880.
The previous prime is 1028330593. The next prime is 1028330617. The reversal of 1028330597 is 7950338201.
1028330597 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 1028330597 - 22 = 1028330593 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1028330597.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1028330593) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 38429 + ... + 59442.
It is an arithmetic number, because the mean of its divisors is an integer number (78297600).
Almost surely, 21028330597 is an apocalyptic number.
It is an amenable number.
1028330597 is a deficient number, since it is larger than the sum of its proper divisors (224431003).
1028330597 is an equidigital number, since it uses as much as digits as its factorization.
1028330597 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97976.
The product of its (nonzero) digits is 45360, while the sum is 38.
The square root of 1028330597 is about 32067.5941879025. The cubic root of 1028330597 is about 1009.3557296873.
Adding to 1028330597 its reverse (7950338201), we get a palindrome (8978668798).
The spelling of 1028330597 in words is "one billion, twenty-eight million, three hundred thirty thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •