Search a number
-
+
110000110210011 = 3271746033495397
BaseRepresentation
bin11001000000101101100101…
…011111101000101111011011
3112102110220111210221000211100
4121000231211133220233123
5103404220211203210021
61025541204130002443
732112150163344540
oct3100554537505733
9472426453830740
10110000110210011
113205a86a57564a
1210406912416423
13494bc7307b298
141d2406882cbc7
15cab54e232626
hex640b657e8bdb

110000110210011 has 12 divisors (see below), whose sum is σ = 181587483521392. Its totient is φ = 62857205834256.

The previous prime is 110000110210007. The next prime is 110000110210073. The reversal of 110000110210011 is 110012011000011.

It is not a de Polignac number, because 110000110210011 - 22 = 110000110210007 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 = 110000110209975 and 110000110210002.

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

Almost surely, 2110000110210011 is an apocalyptic number.

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

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

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

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

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

Adding to 110000110210011 its reverse (110012011000011), we get a palindrome (220012121210022).

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

Divisors: 1 3 7 9 21 63 1746033495397 5238100486191 12222234467779 15714301458573 36666703403337 110000110210011