Search a number
-
+
105050005055 = 521010001011
BaseRepresentation
bin110000111010101110…
…1111101111000111111
3101001011010010011211222
41201311131331320333
53210120300130210
6120132002103555
710406144211212
oct1416535757077
9331133104758
10105050005055
1140607a976a6
121843904abbb
139ba1b28b08
145127a1b779
152aec76c655
hex187577de3f

105050005055 has 4 divisors (see below), whose sum is σ = 126060006072. Its totient is φ = 84040004040.

The previous prime is 105050005001. The next prime is 105050005063. The reversal of 105050005055 is 550500050501.

It is a semiprime because it is the product of two primes.

It is not a de Polignac number, because 105050005055 - 26 = 105050004991 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10505000501 + ... + 10505000510.

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

Almost surely, 2105050005055 is an apocalyptic number.

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

105050005055 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 21010001016.

The product of its (nonzero) digits is 3125, while the sum is 26.

Adding to 105050005055 its reverse (550500050501), we get a palindrome (655550055556).

The spelling of 105050005055 in words is "one hundred five billion, fifty million, five thousand, fifty-five".

Divisors: 1 5 21010001011 105050005055