Search a number
-
+
10528660047 = 329121019081
BaseRepresentation
bin10011100111000111…
…01001101001001111
31000011202112100101010
421303203221221033
5133030314110142
64500425420303
7521624063613
oct116343515117
930152470333
1010528660047
114513177144
12205a03a693
13cba398679
1471c459343
154194d7e9c
hex2738e9a4f

10528660047 has 8 divisors (see below), whose sum is σ = 14522289840. Its totient is φ = 6777068480.

The previous prime is 10528660033. The next prime is 10528660147. The reversal of 10528660047 is 74006682501.

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 10528660047 - 210 = 10528659023 is a prime.

It is a super-2 number, since 2×105286600472 (a number of 21 digits) contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 10528659987 and 10528660014.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10528660027) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 60509454 + ... + 60509627.

It is an arithmetic number, because the mean of its divisors is an integer number (1815286230).

Almost surely, 210528660047 is an apocalyptic number.

10528660047 is a deficient number, since it is larger than the sum of its proper divisors (3993629793).

10528660047 is a wasteful number, since it uses less digits than its factorization.

10528660047 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 121019113.

The product of its (nonzero) digits is 80640, while the sum is 39.

The spelling of 10528660047 in words is "ten billion, five hundred twenty-eight million, six hundred sixty thousand, forty-seven".

Divisors: 1 3 29 87 121019081 363057243 3509553349 10528660047