Search a number
101111010001001 = 71113101010000001
BaseRepresentation
bin10110111111010110111101…
…110101011000000001101001
3111021000010012010122022001022
4112333112331311120001221
5101223100322030013001
6555013431242502225
730204013041265130
oct2677267565300151
9437003163568038
10101111010001001
112a242a36206950
12b40bba8804975
13445595bc3a9c0
15ba51e1b3811b
hex5bf5bdd58069

101111010001001 has 16 divisors (see below), whose sum is σ = 135757440002688. Its totient is φ = 72727200000000.

The previous prime is 101111010000991. The next prime is 101111010001081. The reversal of 101111010001001 is 100100010111101.

Adding to 101111010001001 its reverse (100100010111101), we get a palindrome (201211020112102).

It is not a de Polignac number, because 101111010001001 - 26 = 101111010000937 is a prime.

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 101111010001001.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 50504999000 + ... + 50505001001.

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

Almost surely, 2101111010001001 is an apocalyptic number.

101111010001001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 101010000032.

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

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