Search a number
-
+
1000110220011 = 32715874765397
BaseRepresentation
bin11101000110110110011…
…01101110001011101011
310112121110101211011220200
432203123031232023223
5112341211204020021
62043235544523243
7132153443415120
oct16433315561353
93477411734820
101000110220011
11356165167911
121419b2a80523
137340507a096
1436596d38747
151b036289126
hexe8db36e2eb

1000110220011 has 12 divisors (see below), whose sum is σ = 1650975601392. Its totient is φ = 571491554256.

The previous prime is 1000110220001. The next prime is 1000110220033. The reversal of 1000110220011 is 1100220110001.

It is a happy number.

It is not a de Polignac number, because 1000110220011 - 27 = 1000110219883 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a junction number, because it is equal to n+sod(n) for n = 1000110219975 and 1000110220002.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7937382636 + ... + 7937382761.

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

Almost surely, 21000110220011 is an apocalyptic number.

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

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

1000110220011 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 15874765410 (or 15874765407 counting only the distinct ones).

The product of its (nonzero) digits is 4, while the sum is 9.

Adding to 1000110220011 its reverse (1100220110001), we get a palindrome (2100330330012).

The spelling of 1000110220011 in words is "one trillion, one hundred ten million, two hundred twenty thousand, eleven".

Divisors: 1 3 7 9 21 63 15874765397 47624296191 111123357779 142872888573 333370073337 1000110220011