Search a number
-
+
110200201101 = 3225247484987
BaseRepresentation
bin110011010100001110…
…0011001111110001101
3101112110001010020122200
41212220130121332031
53301142222413401
6122343020432113
710650602153064
oct1465034317615
9345401106580
10110200201101
1142810160171
12194359a8639
13a512b248b3
145495a191db
152cee991686
hex19a8719f8d

110200201101 has 12 divisors (see below), whose sum is σ = 159184701312. Its totient is φ = 73463739336.

The previous prime is 110200201061. The next prime is 110200201109. The reversal of 110200201101 is 101102002011.

It is a happy number.

It is not a de Polignac number, because 110200201101 - 219 = 110199676813 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 2110200201101 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 110200201101 its reverse (101102002011), we get a palindrome (211302203112).

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

Divisors: 1 3 9 25247 75741 227223 484987 1454961 4364883 12244466789 36733400367 110200201101