Search a number
-
+
10110201111002 = 25055100555501
BaseRepresentation
bin1001001100011111011011…
…1100100010000111011010
31022210112012022001201122002
42103013312330202013122
52311121142441023002
633300321241201002
72062303131340226
oct223076674420732
938715168051562
1010110201111002
113248791a55873
121173511a90162
1358450720b305
1426d49cd03786
15127ec9a14002
hex931f6f221da

10110201111002 has 4 divisors (see below), whose sum is σ = 15165301666506. Its totient is φ = 5055100555500.

The previous prime is 10110201110969. The next prime is 10110201111071. The reversal of 10110201111002 is 20011110201101.

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

It can be written as a sum of positive squares in only one way, i.e., 6645573565801 + 3464627545201 = 2577901^2 + 1861351^2 .

It is an unprimeable number.

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

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

Almost surely, 210110201111002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5055100555503.

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

Adding to 10110201111002 its reverse (20011110201101), we get a palindrome (30121311312103).

Subtracting 10110201111002 from its reverse (20011110201101), we obtain a palindrome (9900909090099).

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

Divisors: 1 2 5055100555501 10110201111002