Search a number
-
+
10110100110102 = 23462408025371
BaseRepresentation
bin1001001100011111000011…
…1011001111101100010110
31022210111221021000100110000
42103013300323033230112
52311120441112010402
633300303232312130
72062300464006036
oct223076073175426
938714837010400
1010110100110102
11324873aa40353
1211734a40a2646
135844bc307075
1426d48d7318c6
15127ec0c12c1c
hex931f0ecfb16

10110100110102 has 20 divisors (see below), whose sum is σ = 22654113210036. Its totient is φ = 3370033369980.

The previous prime is 10110100110059. The next prime is 10110100110133. The reversal of 10110100110102 is 20101100101101.

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 9 ways as a sum of consecutive naturals, for example, 31204012524 + ... + 31204012847.

Almost surely, 210110100110102 is an apocalyptic number.

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

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

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

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

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

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

Adding to 10110100110102 its reverse (20101100101101), we get a palindrome (30211200211203).

Subtracting 10110100110102 from its reverse (20101100101101), we obtain a palindrome (9990999990999).

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

Divisors: 1 2 3 6 9 18 27 54 81 162 62408025371 124816050742 187224076113 374448152226 561672228339 1123344456678 1685016685017 3370033370034 5055050055051 10110100110102