Search a number
-
+
10201102111 = 101101001011
BaseRepresentation
bin10011000000000100…
…00111011100011111
3222022221011200100201
421200002013130133
5131342440231421
64404125004331
7510535636324
oct114002073437
928287150321
1010201102111
114365290002
121b883b36a7
13c6756c2c5
146cab50b4b
153ea883b91
hex26008771f

10201102111 has 4 divisors (see below), whose sum is σ = 10302103224. Its totient is φ = 10100101000.

The previous prime is 10201102103. The next prime is 10201102139. The reversal of 10201102111 is 11120110201.

It is a semiprime because it is the product of two primes.

It is not a de Polignac number, because 10201102111 - 23 = 10201102103 is a prime.

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 50500405 + ... + 50500606.

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

Almost surely, 210201102111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 101001112.

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

Adding to 10201102111 its reverse (11120110201), we get a palindrome (21321212312).

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

Divisors: 1 101 101001011 10201102111