Search a number
-
+
556550055655 = 51111131909091
BaseRepresentation
bin10000001100101001111…
…01111110011011100111
31222012112221010012001021
420012110331332123213
533104303303240110
61103401531112011
755131554263306
oct10062475763347
91865487105037
10556550055655
111a5038aa7290
128ba435a2607
1340636c16179
141cd1982843d
15e7255652da
hex8194f7e6e7

556550055655 has 16 divisors (see below), whose sum is σ = 728640874368. Its totient is φ = 404726868000.

The previous prime is 556550055647. The next prime is 556550055703.

556550055655 is nontrivially palindromic in base 10.

It is not a de Polignac number, because 556550055655 - 23 = 556550055647 is a prime.

It is a congruent number.

It is an unprimeable number.

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

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

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

Almost surely, 2556550055655 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 920238.

The product of its (nonzero) digits is 14062500, while the sum is 52.

It can be divided in two parts, 5565500 and 55655, that multiplied together give a square (309747902500 = 5565502).

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

Divisors: 1 5 11 55 11131 55655 122441 612205 909091 4545455 10000001 50000005 10119091921 50595459605 111310011131 556550055655