Search a number
-
+
110220010011 = 339742084769
BaseRepresentation
bin110011010100110011…
…1111110001000011011
3101112111102101122101000
41212221213332020123
53301212310310021
6122345005200043
710651232425026
oct1465147761033
9345442348330
10110220010011
114282035a971
1219440560023
13a516c6c047
1454984d41bd
152d015a5b26
hex19a99fe21b

110220010011 has 16 divisors (see below), whose sum is σ = 164972298400. Its totient is φ = 72722479104.

The previous prime is 110220009989. The next prime is 110220010013. The reversal of 110220010011 is 110010022011.

It is a happy number.

It is not a de Polignac number, because 110220010011 - 25 = 110220009979 is a prime.

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

It is a Duffinian number.

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

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

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

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

Almost surely, 2110220010011 is an apocalyptic number.

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

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

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

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

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

Adding to 110220010011 its reverse (110010022011), we get a palindrome (220230032022).

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

Divisors: 1 3 9 27 97 291 873 2619 42084769 126254307 378762921 1136288763 4082222593 12246667779 36740003337 110220010011