Search a number
-
+
10505005005 = 351163666697
BaseRepresentation
bin10011100100010010…
…11010011111001101
31000010010000112202110
421302021122133031
5133003240130010
64454222414233
7521216032515
oct116211323715
930103015673
1010505005005
11450088a820
122052131379
13cb55056c1
1471925c845
154173b4120
hex27225a7cd

10505005005 has 16 divisors (see below), whose sum is σ = 18336009024. Its totient is φ = 5093335680.

The previous prime is 10505004977. The next prime is 10505005087. The reversal of 10505005005 is 50050050501.

It is not a de Polignac number, because 10505005005 - 28 = 10505004749 is a prime.

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

It is a Curzon number.

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 210505005005 is an apocalyptic number.

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

It is an amenable number.

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

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

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

The sum of its prime factors is 63666716.

The product of its (nonzero) digits is 625, while the sum is 21.

Adding to 10505005005 its reverse (50050050501), we get a palindrome (60555055506).

The spelling of 10505005005 in words is "ten billion, five hundred five million, five thousand, five".

Divisors: 1 3 5 11 15 33 55 165 63666697 191000091 318333485 700333667 955000455 2101001001 3501668335 10505005005