Search a number
-
+
10520501505 = 351674199801
BaseRepresentation
bin10011100110001001…
…00001110100000001
31000011012011211221220
421303010201310001
5133021222022010
64455534505253
7521464534023
oct116304416401
930135154856
1010520501505
114509604548
122057365229
13cb87a0027
1471b334013
15418925970
hex273121d01

10520501505 has 16 divisors (see below), whose sum is σ = 16933601664. Its totient is φ = 5577334400.

The previous prime is 10520501447. The next prime is 10520501513. The reversal of 10520501505 is 50510502501.

It is not a de Polignac number, because 10520501505 - 212 = 10520497409 is a prime.

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

It is an unprimeable number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2097396 + ... + 2102405.

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

Almost surely, 210520501505 is an apocalyptic number.

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

It is an amenable number.

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

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

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

The sum of its prime factors is 4199976.

The product of its (nonzero) digits is 1250, while the sum is 24.

The spelling of 10520501505 in words is "ten billion, five hundred twenty million, five hundred one thousand, five hundred five".

Divisors: 1 3 5 15 167 501 835 2505 4199801 12599403 20999005 62997015 701366767 2104100301 3506833835 10520501505