Search a number
-
+
10506550015 = 513225149537
BaseRepresentation
bin10011100100011110…
…10011101011111111
31000010012221001010001
421302033103223333
5133004134100030
64454315455131
7521235126103
oct116217235377
930105831101
1010506550015
114501745595
1220527574a7
13cb5926a00
14719541903
154175bbcca
hex2723d3aff

10506550015 has 24 divisors (see below), whose sum is σ = 13706966448. Its totient is φ = 7727616000.

The previous prime is 10506550013. The next prime is 10506550111. The reversal of 10506550015 is 51005560501.

It is not a de Polignac number, because 10506550015 - 21 = 10506550013 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 187327 + ... + 236863.

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

Almost surely, 210506550015 is an apocalyptic number.

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

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

10506550015 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 49819 (or 49806 counting only the distinct ones).

The product of its (nonzero) digits is 3750, while the sum is 28.

The spelling of 10506550015 in words is "ten billion, five hundred six million, five hundred fifty thousand, fifteen".

Divisors: 1 5 13 65 169 251 845 1255 3263 16315 42419 49537 212095 247685 643981 3219905 8371753 12433787 41858765 62168935 161639231 808196155 2101310003 10506550015