Search a number
-
+
10120101111 = 329771150927
BaseRepresentation
bin10010110110011010…
…00111110011110111
3222010021202101212200
421123031013303313
5131211221213421
64352112515543
7505533303651
oct113315076367
928107671780
1010120101111
11432359582a
121b6524bbb3
13c5384b413
146c00a76d1
153e36d3726
hex25b347cf7

10120101111 has 12 divisors (see below), whose sum is σ = 14632898592. Its totient is φ = 6739822656.

The previous prime is 10120101109. The next prime is 10120101113. The reversal of 10120101111 is 11110102101.

It is an interprime number because it is at equal distance from previous prime (10120101109) and next prime (10120101113).

It is not a de Polignac number, because 10120101111 - 21 = 10120101109 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 = 10120101093 and 10120101102.

It is a congruent number.

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

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

Almost surely, 210120101111 is an apocalyptic number.

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

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

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

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

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

Adding to 10120101111 its reverse (11110102101), we get a palindrome (21230203212).

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

Divisors: 1 3 9 977 2931 8793 1150927 3452781 10358343 1124455679 3373367037 10120101111