Search a number
-
+
10102011111 = 321122445679
BaseRepresentation
bin10010110100010000…
…00111010011100111
3222002000201100001200
421122020013103213
5131142103323421
64350225053543
7505223451303
oct113210072347
928060640050
1010102011111
11431435a515
121b5b1872b3
13c4cb8648a
146bb918d03
153e1d0d726
hex25a2074e7

10102011111 has 6 divisors (see below), whose sum is σ = 14591793840. Its totient is φ = 6734674068.

The previous prime is 10102011097. The next prime is 10102011169. The reversal of 10102011111 is 11111020101.

It is not a de Polignac number, because 10102011111 - 26 = 10102011047 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 1122445679 = 10102011111 / (1 + 0 + 1 + 0 + 2 + 0 + 1 + 1 + 1 + 1 + 1).

It is a junction number, because it is equal to n+sod(n) for n = 10102011093 and 10102011102.

It is a congruent number.

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 561222831 + ... + 561222848.

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

Almost surely, 210102011111 is an apocalyptic number.

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

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

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

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

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

Adding to 10102011111 its reverse (11111020101), we get a palindrome (21213031212).

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

Divisors: 1 3 9 1122445679 3367337037 10102011111