Search a number
-
+
1110050555001 = 3370016851667
BaseRepresentation
bin10000001001110100001…
…010110100010001111001
310221010020022221212021120
4100021310022310101321
5121141340420230001
62205541123455453
7143125042015113
oct20116412642171
93833208855246
101110050555001
113988516657a3
1215b175827589
13808a60b663b
143ba2622a3b3
151dd1cee8236
hex102742b4479

1110050555001 has 4 divisors (see below), whose sum is σ = 1480067406672. Its totient is φ = 740033703332.

The previous prime is 1110050554997. The next prime is 1110050555039. The reversal of 1110050555001 is 1005550500111.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 1110050555001 - 22 = 1110050554997 is a prime.

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

It is not an unprimeable number, because it can be changed into a prime (1110050555501) 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, 185008425831 + ... + 185008425836.

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

Almost surely, 21110050555001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 370016851670.

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

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

Divisors: 1 3 370016851667 1110050555001