Search a number
-
+
110201010102 = 2326122278339
BaseRepresentation
bin110011010100001111…
…1011111011110110110
3101112110002122100101200
41212220133133132312
53301142424310402
6122343050033330
710650612062511
oct1465037373666
9345402570350
10110201010102
1142810662a67
1219436118846
13a513048bb1
145495b89d78
152ceeaa121c
hex19a87df7b6

110201010102 has 12 divisors (see below), whose sum is σ = 238768855260. Its totient is φ = 36733670028.

The previous prime is 110201010077. The next prime is 110201010193. The reversal of 110201010102 is 201010102011.

It is a happy number.

It is a super-2 number, since 2×1102010101022 (a number of 23 digits) contains 22 as substring.

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 5 ways as a sum of consecutive naturals, for example, 3061139152 + ... + 3061139187.

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

Almost surely, 2110201010102 is an apocalyptic number.

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

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

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

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

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

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

Adding to 110201010102 its reverse (201010102011), we get a palindrome (311211112113).

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

Divisors: 1 2 3 6 9 18 6122278339 12244556678 18366835017 36733670034 55100505051 110201010102