Search a number
-
+
10679539605 = 357101709901
BaseRepresentation
bin10011111001000110…
…01101011110010101
31000120021102211012220
421330203031132111
5133332430231410
64523415332553
7525435405660
oct117443153625
930507384186
1010679539605
11459035a199
1220a0681159
131012714a07
147344d26d7
1542788d070
hex27c8cd795

10679539605 has 16 divisors (see below), whose sum is σ = 19528301184. Its totient is φ = 4882075200.

The previous prime is 10679539597. The next prime is 10679539667. The reversal of 10679539605 is 50693597601.

It is not a de Polignac number, because 10679539605 - 23 = 10679539597 is a prime.

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

It is a congruent number.

It is an unprimeable number.

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 15 ways as a sum of consecutive naturals, for example, 50854846 + ... + 50855055.

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

Almost surely, 210679539605 is an apocalyptic number.

10679539605 is a gapful number since it is divisible by the number (15) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 101709916.

The product of its (nonzero) digits is 1530900, while the sum is 51.

The spelling of 10679539605 in words is "ten billion, six hundred seventy-nine million, five hundred thirty-nine thousand, six hundred five".

Divisors: 1 3 5 7 15 21 35 105 101709901 305129703 508549505 711969307 1525648515 2135907921 3559846535 10679539605