Search a number
-
+
10524545133 = 317320278507
BaseRepresentation
bin10011100110100111…
…11101000001101101
31000011110210021202220
421303103331001231
5133023240421013
64500201305553
7521544105024
oct116323750155
930143707686
1010524545133
114510916593
1220587952b9
13cb95876cb
1471baa78bb
15418e73b23
hex2734fd06d

10524545133 has 8 divisors (see below), whose sum is σ = 14113841568. Its totient is φ = 6975806064.

The previous prime is 10524545131. The next prime is 10524545159. The reversal of 10524545133 is 33154542501.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 10524545133 - 21 = 10524545131 is a prime.

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

It is a Curzon number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10524545131) 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, 10138735 + ... + 10139772.

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

Almost surely, 210524545133 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 20278683.

The product of its (nonzero) digits is 36000, while the sum is 33.

The spelling of 10524545133 in words is "ten billion, five hundred twenty-four million, five hundred forty-five thousand, one hundred thirty-three".

Divisors: 1 3 173 519 20278507 60835521 3508181711 10524545133