Search a number
-
+
10005005105 = 535915673557
BaseRepresentation
bin10010101000101100…
…00100001100110001
3221211021011220211122
421110112010030301
5130442240130410
64332441552025
7502635066044
oct112426041461
927737156748
1010005005105
114274623467
121b327a5615
13c35a50684
146acaa6c5b
153d854ae55
hex254584331

10005005105 has 16 divisors (see below), whose sum is σ = 12050519040. Its totient is φ = 7974372672.

The previous prime is 10005005089. The next prime is 10005005107. The reversal of 10005005105 is 50150050001.

It is a cyclic number.

It is not a de Polignac number, because 10005005105 - 24 = 10005005089 is a prime.

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

It is a Curzon number.

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

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, 2810987 + ... + 2814543.

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

Almost surely, 210005005105 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 5488.

The product of its (nonzero) digits is 125, while the sum is 17.

Adding to 10005005105 its reverse (50150050001), we get a palindrome (60155055106).

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

Divisors: 1 5 359 1567 1795 3557 7835 17785 562553 1276963 2812765 5573819 6384815 27869095 2001001021 10005005105