Search a number
-
+
101111001011001 = 3226342716941703
BaseRepresentation
bin10110111111010110111101…
…010011000101001100111001
3111021000010011111201120002100
4112333112331103011030321
5101223100312224323001
6555013430322054013
730204012602003202
oct2677267523051471
9437003144646070
10101111001011001
112a242a311265a3
12b40bba57aa309
13445595a110a87
141ad7b273705a9
15ba51e0e5e586
hex5bf5bd4c5339

101111001011001 has 12 divisors (see below), whose sum is σ = 146604543928128. Its totient is φ = 67151032355544.

The previous prime is 101111001010949. The next prime is 101111001011023. The reversal of 101111001011001 is 100110100111101.

It is a de Polignac number, because none of the positive numbers 2k-101111001011001 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 (101111001012001) 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, 21358468485 + ... + 21358473218.

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

Almost surely, 2101111001011001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 101111001011001 its reverse (100110100111101), we get a palindrome (201221101122102).

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

Divisors: 1 3 9 263 789 2367 42716941703 128150825109 384452475327 11234555667889 33703667003667 101111001011001