Search a number
-
+
101102210102 = 2281179897171
BaseRepresentation
bin101111000101000101…
…0010100110000110110
3100122221222122102021002
41132022022110300312
53124024131210402
6114240135123302
710206256415015
oct1361212246066
9318858572232
10101102210102
113997161a943
1217716b13532
1396c2c8537a
144c715b6a7c
15296adaa602
hex178a294c36

101102210102 has 8 divisors (see below), whose sum is σ = 152193007512. Its totient is φ = 50371207600.

The previous prime is 101102210101. The next prime is 101102210117. The reversal of 101102210102 is 201012201101.

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

It is a congruent number.

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

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

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

Almost surely, 2101102210102 is an apocalyptic number.

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

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

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

The sum of its prime factors is 179897454.

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

Adding to 101102210102 its reverse (201012201101), we get a palindrome (302114411203).

Subtracting 101102210102 from its reverse (201012201101), we obtain a palindrome (99909990999).

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

Divisors: 1 2 281 562 179897171 359794342 50551105051 101102210102