Search a number
-
+
101110010102 = 250555005051
BaseRepresentation
bin101111000101010100…
…0000101000011110110
3100122222112022200211222
41132022220011003312
53124033130310402
6114241014230342
710206412622363
oct1361250050366
9318875280758
10101110010102
1139975a68122
12177196553b2
1396c478675a
144c7264746a
15296b8eb7a2
hex178aa050f6

101110010102 has 4 divisors (see below), whose sum is σ = 151665015156. Its totient is φ = 50555005050.

The previous prime is 101110010051. The next prime is 101110010123. The reversal of 101110010102 is 201010011101.

It is a happy number.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 201010011101 = 510139406001.

It is a self number, because there is not a number n which added to its sum of digits gives 101110010102.

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, 25277502524 + ... + 25277502527.

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

Almost surely, 2101110010102 is an apocalyptic number.

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

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

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

The sum of its prime factors is 50555005053.

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

Adding to 101110010102 its reverse (201010011101), we get a palindrome (302120021203).

Subtracting 101110010102 from its reverse (201010011101), we obtain a palindrome (99900000999).

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

Divisors: 1 2 50555005051 101110010102