Search a number
-
+
10211011102 = 25105505551
BaseRepresentation
bin10011000001001111…
…11010101000011110
3222100121211002221101
421200213322220132
5131403004323402
64405121223314
7511016106445
oct114047725036
928317732841
1010211011102
11436a938856
121b8b791b3a
13c6962b606
146cc1add5c
153eb68eb87
hex2609faa1e

10211011102 has 4 divisors (see below), whose sum is σ = 15316516656. Its totient is φ = 5105505550.

The previous prime is 10211011079. The next prime is 10211011123. The reversal of 10211011102 is 20111011201.

10211011102 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, and also an emirpimes, since its reverse is a distinct semiprime: 20111011201 = 22788594763.

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, 2552752774 + ... + 2552752777.

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

Almost surely, 210211011102 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5105505553.

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

Adding to 10211011102 its reverse (20111011201), we get a palindrome (30322022303).

Subtracting 10211011102 from its reverse (20111011201), we obtain a palindrome (9900000099).

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

Divisors: 1 2 5105505551 10211011102