Search a number
-
+
110121021001 = 4173137271991
BaseRepresentation
bin110011010001110111…
…0010110111001001001
3101112020112010110222101
41212203232112321021
53301011440133001
6122331111353401
710645621143235
oct1464356267111
9345215113871
10110121021001
114277a499a72
1219413382861
13a4cc5c0774
1454892c75c5
152ce7a50a01
hex19a3b96e49

110121021001 has 32 divisors (see below), whose sum is σ = 115728592896. Its totient is φ = 104696064000.

The previous prime is 110121020993. The next prime is 110121021019. The reversal of 110121021001 is 100120121011.

It is a cyclic number.

It is not a de Polignac number, because 110121021001 - 23 = 110121020993 is a prime.

It is a Duffinian number.

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 111120616 + ... + 111121606.

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

Almost surely, 2110121021001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1513.

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

Adding to 110121021001 its reverse (100120121011), we get a palindrome (210241142012).

It can be divided in two parts, 1101210 and 21001, that added together give a palindrome (1122211).

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

Divisors: 1 41 73 137 271 991 2993 5617 10001 11111 19783 37127 40631 72343 135767 268561 410041 811103 1522207 2710271 2966063 5566447 9910991 11011001 19604953 36792857 111121111 406350631 803803073 1508507137 2685878561 110121021001