Search a number
-
+
10111010102 = 25055505051
BaseRepresentation
bin10010110101010100…
…11100010100110110
3222002122122112100122
421122222130110312
5131201404310402
64351150011542
7505363111364
oct113252342466
928078575318
1010111010102
1143194465a6
121b621a6bb2
13c519b751b
146bcbbc634
153e29d9ca2
hex25aa9c536

10111010102 has 4 divisors (see below), whose sum is σ = 15166515156. Its totient is φ = 5055505050.

The previous prime is 10111010099. The next prime is 10111010137. The reversal of 10111010102 is 20101011101.

It is a happy number.

10111010102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

It is a self number, because there is not a number n which added to its sum of digits gives 10111010102.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2527752524 + ... + 2527752527.

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

Almost surely, 210111010102 is an apocalyptic number.

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

10111010102 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 5055505053.

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

Adding to 10111010102 its reverse (20101011101), we get a palindrome (30212021203).

Subtracting 10111010102 from its reverse (20101011101), we obtain a palindrome (9990000999).

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

Divisors: 1 2 5055505051 10111010102