Search a number
BaseRepresentation
bin101111000101010100…
…0011101011110010110
3100122222112111210000200
41132022220131132112
53124033142010402
6114241020321330
710206413520051
oct1361250353626
9318875453020
10101110110102
1139976026271
12177196a3246
1396c47c0121
144c72671a98
15296b91b21c
hex178aa1d796

101110110102 has 24 divisors (see below), whose sum is σ = 219115253136. Its totient is φ = 33696701136.

The previous prime is 101110110097. The next prime is 101110110139. The reversal of 101110110102 is 201011011101.

101110110102 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 461818 + ... + 644589.

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

Almost surely, 2101110110102 is an apocalyptic number.

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

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

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

101110110102 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 1111492 (or 1111489 counting only the distinct ones).

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

Adding to 101110110102 its reverse (201011011101), we get a palindrome (302121121203).

Subtracting 101110110102 from its reverse (201011011101), we obtain a palindrome (99900900999).

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