Search a number
-
+
10111201102 = 210150055451
BaseRepresentation
bin10010110101010110…
…01010111101001110
3222002200000020100201
421122223022331032
5131201431413402
64351154044114
7505364535262
oct113253127516
928080006321
1010111201102
114319567052
121b6227963a
13c51a53442
146bcc2c0a2
153e2a26687
hex25aacaf4e

10111201102 has 8 divisors (see below), whose sum is σ = 15316968312. Its totient is φ = 5005545000.

The previous prime is 10111201069. The next prime is 10111201153. The reversal of 10111201102 is 20110211101.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a congruent number.

It is an unprimeable number.

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 3 ways as a sum of consecutive naturals, for example, 25027524 + ... + 25027927.

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

Almost surely, 210111201102 is an apocalyptic number.

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

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

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

The sum of its prime factors is 50055554.

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

Adding to 10111201102 its reverse (20110211101), we get a palindrome (30221412203).

Subtracting 10111201102 from its reverse (20110211101), we obtain a palindrome (9999009999).

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

Divisors: 1 2 101 202 50055451 100110902 5055600551 10111201102