Search a number
-
+
110200120011 = 3231394982509
BaseRepresentation
bin110011010100001110…
…0000110001011001011
3101112110000222010102100
41212220130012023023
53301142212320021
6122343015004443
710650601364502
oct1465034061313
9345400863370
10110200120011
1142810105253
1219435969723
13a512ac6a07
1454959d7839
152cee977626
hex19a87062cb

110200120011 has 12 divisors (see below), whose sum is σ = 164312724160. Its totient is φ = 71096851440.

The previous prime is 110200119971. The next prime is 110200120021. The reversal of 110200120011 is 110021002011.

It is a happy number.

It is not a de Polignac number, because 110200120011 - 29 = 110200119499 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 = 110200119975 and 110200120002.

It is not an unprimeable number, because it can be changed into a prime (110200120021) 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 11 ways as a sum of consecutive naturals, for example, 197490976 + ... + 197491533.

Almost surely, 2110200120011 is an apocalyptic number.

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

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

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

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

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

Adding to 110200120011 its reverse (110021002011), we get a palindrome (220221122022).

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

Divisors: 1 3 9 31 93 279 394982509 1184947527 3554842581 12244457779 36733373337 110200120011