Search a number
-
+
100111121001 = 3237300633997
BaseRepresentation
bin101110100111100010…
…1100111101001101001
3100120101220201212121100
41131033011213221221
53120011421333001
6113553532432013
710142563326303
oct1351705475151
9316356655540
10100111121001
1139503132a41
121749b018609
139595848108
144bb9b08973
15290dd89586
hex174f167a69

100111121001 has 12 divisors (see below), whose sum is σ = 148513195012. Its totient is φ = 64936943136.

The previous prime is 100111120957. The next prime is 100111121027. The reversal of 100111121001 is 100121111001.

It can be written as a sum of positive squares in 2 ways, for example, as 47709043776 + 52402077225 = 218424^2 + 228915^2 .

It is not a de Polignac number, because 100111121001 - 27 = 100111120873 is a prime.

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

It is a Duffinian number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 150316666 + ... + 150317331.

Almost surely, 2100111121001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 100111121001 its reverse (100121111001), we get a palindrome (200232232002).

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

Divisors: 1 3 9 37 111 333 300633997 901901991 2705705973 11123457889 33370373667 100111121001