Search a number
-
+
10101311111 = 471099532069
BaseRepresentation
bin10010110100001010…
…11100011010000111
3222001222101202211202
421122011130122013
5131141413423421
64350202053115
7505214504423
oct113205343207
928058352752
1010101311111
114313a21601
121b5aaaa19b
13c4c99c988
146bb7b5b83
153e1c2110b
hex25a15c687

10101311111 has 16 divisors (see below), whose sum is σ = 10426838400. Its totient is φ = 9780680448.

The previous prime is 10101311089. The next prime is 10101311113. The reversal of 10101311111 is 11111310101.

It is not a de Polignac number, because 10101311111 - 26 = 10101311047 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4881185 + ... + 4883253.

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

Almost surely, 210101311111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3178.

The product of its (nonzero) digits is 3, while the sum is 11.

Adding to 10101311111 its reverse (11111310101), we get a palindrome (21212621212).

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

Divisors: 1 47 109 953 2069 5123 44791 97243 103877 225521 1971757 4882219 10599487 92672579 214921513 10101311111