Search a number
-
+
120110211 = 32131026583
BaseRepresentation
bin1110010100010…
…11110010000011
322101000020020100
413022023302003
5221222011321
615530213443
72655630354
oct712136203
9271006210
10120110211
1161887641
1234284283
131bb65140
1411d47d2b
15a828326
hex728bc83

120110211 has 12 divisors (see below), whose sum is σ = 186838288. Its totient is φ = 73913904.

The previous prime is 120110201. The next prime is 120110293. The reversal of 120110211 is 112011021.

It is a happy number.

It is not a de Polignac number, because 120110211 - 29 = 120109699 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 = 120110193 and 120110202.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

Almost surely, 2120110211 is an apocalyptic number.

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

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

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

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

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

The square root of 120110211 is about 10959.4804165161. The cubic root of 120110211 is about 493.3933707166.

Adding to 120110211 its reverse (112011021), we get a palindrome (232121232).

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

Divisors: 1 3 9 13 39 117 1026583 3079749 9239247 13345579 40036737 120110211