Search a number
-
+
55500101111 = 713837348087
BaseRepresentation
bin110011101100000100…
…000101010111110111
312022020220020020221102
4303230010011113313
51402131011213421
641255115440315
74003226034650
oct635404052767
9168226206842
1055500101111
11215a03a6464
12a90aa5609b
1353063ba720
142986db2527
15169c68460b
hexcec1055f7

55500101111 has 16 divisors (see below), whose sum is σ = 69130811904. Its totient is φ = 43383099744.

The previous prime is 55500101101. The next prime is 55500101131. The reversal of 55500101111 is 11110100555.

It is a cyclic number.

It is not a de Polignac number, because 55500101111 - 210 = 55500100087 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 255500101111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 7348190.

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

Adding to 55500101111 its reverse (11110100555), we get a palindrome (66610201666).

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

Divisors: 1 7 13 83 91 581 1079 7553 7348087 51436609 95525131 609891221 668675917 4269238547 7928585873 55500101111