Search a number
-
+
110101001022 = 23219933069103
BaseRepresentation
bin110011010001010000…
…1111111001100111110
3101112012010110100201200
41212202201333030332
53300441324013042
6122325114320330
710645256032035
oct1464241771476
9345163410650
10110101001022
114276a165731
12194087290a6
13a4c840121c
14548679571c
152ce5de8c4c
hex19a287f33e

110101001022 has 24 divisors (see below), whose sum is σ = 238671941664. Its totient is φ = 36681907104.

The previous prime is 110101001009. The next prime is 110101001039. The reversal of 110101001022 is 220100101011.

It is a happy number.

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

It is a junction number, because it is equal to n+sod(n) for n = 110101000995 and 110101001013.

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, 1498678 + ... + 1570425.

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

Almost surely, 2110101001022 is an apocalyptic number.

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

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

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

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

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

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

Adding to 110101001022 its reverse (220100101011), we get a palindrome (330201102033).

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

Divisors: 1 2 3 6 9 18 1993 3986 5979 11958 17937 35874 3069103 6138206 9207309 18414618 27621927 55243854 6116722279 12233444558 18350166837 36700333674 55050500511 110101001022