Search a number
-
+
110101011021 = 342027670583
BaseRepresentation
bin110011010001010001…
…0000001101001001101
3101112012010110212110000
41212202202001221031
53300441324323041
6122325114434513
710645256103141
oct1464242015115
9345163425400
10110101011021
114276a1721a1
1219408732a39
13a4c8405941
145486799221
152ce5debbb6
hex19a2881a4d

110101011021 has 20 divisors (see below), whose sum is σ = 164553266592. Its totient is φ = 73364353128.

The previous prime is 110101011011. The next prime is 110101011043. The reversal of 110101011021 is 120110101011.

It is not a de Polignac number, because 110101011021 - 214 = 110100994637 is a prime.

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 = 110101010994 and 110101011012.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (110101011001) by changing a digit.

It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 171105 + ... + 499478.

Almost surely, 2110101011021 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 110101011021 its reverse (120110101011), we get a palindrome (230211112032).

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

Divisors: 1 3 9 27 81 2027 6081 18243 54729 164187 670583 2011749 6035247 18105741 54317223 1359271741 4077815223 12233445669 36700337007 110101011021