Search a number
-
+
10111102111002 = 236725151995301
BaseRepresentation
bin1001001100100010110010…
…1001100100110100011010
31022210121112002110021021110
42103020230221210310122
52311130014120023002
633300550504521150
72062334351612334
oct223105451446432
938717462407243
1010111102111002
113249104600472
1211737237801b6
1358461ba94bc9
1426d546840454
1512802db8be6c
hex9322ca64d1a

10111102111002 has 16 divisors (see below), whose sum is σ = 20524028166432. Its totient is φ = 3320063379600.

The previous prime is 10111102111001. The next prime is 10111102111013. The reversal of 10111102111002 is 20011120111101.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12575997249 + ... + 12575998052.

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

Almost surely, 210111102111002 is an apocalyptic number.

10111102111002 is an abundant number, since it is smaller than the sum of its proper divisors (10412926055430).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 25151995373.

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

Adding to 10111102111002 its reverse (20011120111101), we get a palindrome (30122222222103).

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

Divisors: 1 2 3 6 67 134 201 402 25151995301 50303990602 75455985903 150911971806 1685183685167 3370367370334 5055551055501 10111102111002