Search a number
-
+
1105011010555 = 54725118733763
BaseRepresentation
bin10000000101000111110…
…010011110101111111011
310220122020010011110221021
4100011013302132233323
5121101030304314210
62203345100523311
7142556126420524
oct20050762365773
93818203143837
101105011010555
113966a59a9431
1215a1a9b50537
1380281cc068a
143b6a8bd384b
151db2587ebda
hex10147c9ebfb

1105011010555 has 16 divisors (see below), whose sum is σ = 1359621656064. Its totient is φ = 861753052000.

The previous prime is 1105011010553. The next prime is 1105011010589. The reversal of 1105011010555 is 5550101105011.

It is not a de Polignac number, because 1105011010555 - 21 = 1105011010553 is a prime.

It is a Duffinian number.

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

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, 9307897 + ... + 9425866.

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

Almost surely, 21105011010555 is an apocalyptic number.

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

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

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

The sum of its prime factors is 18734066.

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

Adding to 1105011010555 its reverse (5550101105011), we get a palindrome (6655112115566).

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

Divisors: 1 5 47 235 251 1255 11797 58985 18733763 93668815 880486861 4402434305 4702174513 23510872565 221002202111 1105011010555