Search a number
-
+
110020100121 = 341358272841
BaseRepresentation
bin110011001110110110…
…1011000000000011001
3101111222111020011120000
41212131231120000121
53300310121200441
6122313104323213
710643254264251
oct1463555300031
9344874204500
10110020100121
1142728529688
12193a5613509
13a4b4716a79
145479b36961
152cddc682b6
hex199db58019

110020100121 has 10 divisors (see below), whose sum is σ = 164351013882. Its totient is φ = 73346733360.

The previous prime is 110020100111. The next prime is 110020100123. The reversal of 110020100121 is 121001020011.

It is a happy number.

It can be written as a sum of positive squares in only one way, i.e., 67320010521 + 42700089600 = 259461^2 + 206640^2 .

It is not a de Polignac number, because 110020100121 - 25 = 110020100089 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 679136340 + ... + 679136501.

Almost surely, 2110020100121 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 110020100121 its reverse (121001020011), we get a palindrome (231021120132).

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

Divisors: 1 3 9 27 81 1358272841 4074818523 12224455569 36673366707 110020100121