Search a number
-
+
1105001055551 = 1278700795713
BaseRepresentation
bin10000000101000111001…
…100100000010100111111
310220122012102102201020102
4100011013030200110333
5121101020232234201
62203344103311315
7142555645666301
oct20050714402477
93818172381212
101105001055551
113966a031a058
1215a1a674b53b
138027cc16443
143b6a7761971
151db24a6526b
hex1014732053f

1105001055551 has 4 divisors (see below), whose sum is σ = 1113701851392. Its totient is φ = 1096300259712.

The previous prime is 1105001055463. The next prime is 1105001055559. The reversal of 1105001055551 is 1555501005011.

It is a happy number.

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1105001055551 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

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

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

Almost surely, 21105001055551 is an apocalyptic number.

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

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

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

The sum of its prime factors is 8700795840.

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

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

Divisors: 1 127 8700795713 1105001055551