Search a number
-
+
111001100111001 = 334111151855963
BaseRepresentation
bin11001001111010001110101…
…001001000100110010011001
3112120000121020112000122012000
4121033101311021010302121
5104022120223112023001
61032025111301311213
732244364511203362
oct3117216511046231
9476017215018160
10111001100111001
1132406336246831
121054890ba05509
1349c2488459349
141d5a6a6514b69
15cc75d7832a86
hex64f475244c99

111001100111001 has 8 divisors (see below), whose sum is σ = 164446074238560. Its totient is φ = 74000733407316.

The previous prime is 111001100110997. The next prime is 111001100111053. The reversal of 111001100111001 is 100111001100111.

It is not a de Polignac number, because 111001100111001 - 22 = 111001100110997 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 (111001100111071) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2055575927955 + ... + 2055575928008.

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

Almost surely, 2111001100111001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 111001100111001 its reverse (100111001100111), we get a palindrome (211112101211112).

The spelling of 111001100111001 in words is "one hundred eleven trillion, one billion, one hundred million, one hundred eleven thousand, one".

Divisors: 1 3 9 27 4111151855963 12333455567889 37000366703667 111001100111001