Cookie Consent by FreePrivacyPolicy.com
Search a number
BaseRepresentation
bin11101011001010010101…
…10100101101100111011
310120120000102002002201000
432230221112211230323
5113022000320231021
62051554231100043
7132654005500242
oct16545126455473
93516012062630
101010011102011
1135a385a3301a
121438b6811623
1374322372342
1436c55c59959
151b4155b8b26
hexeb295a5b3b

1010011102011 has 8 divisors (see below), whose sum is σ = 1496312743760. Its totient is φ = 673340734656.

The previous prime is 1010011101949. The next prime is 1010011102049. The reversal of 1010011102011 is 1102011100101.

It is not a de Polignac number, because 1010011102011 - 221 = 1010009004859 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 a junction number, because it is equal to n+sod(n) for n = 1010011101984 and 1010011102002.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 21010011102011 is an apocalyptic number.

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

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

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

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

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

Adding to 1010011102011 its reverse (1102011100101), we get a palindrome (2112022202112).

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