Search a number
-
+
101102011011 = 32109110296569
BaseRepresentation
bin101111000101000100…
…1100100001010000011
3100122221222021022011100
41132022021210022003
53124024103323021
6114240130545443
710206254625411
oct1361211441203
9318858238140
10101102011011
11399714a4301
1217716a38283
1396c2c15871
144c715642b1
15296ad6b626
hex178a264283

101102011011 has 12 divisors (see below), whose sum is σ = 146170107720. Its totient is φ = 67339554720.

The previous prime is 101102011001. The next prime is 101102011189. The reversal of 101102011011 is 110110201101.

It is not a de Polignac number, because 101102011011 - 214 = 101101994627 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 101102010984 and 101102011002.

It is not an unprimeable number, because it can be changed into a prime (101102011001) 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, 5138466 + ... + 5158103.

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

Almost surely, 2101102011011 is an apocalyptic number.

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

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

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

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

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

Adding to 101102011011 its reverse (110110201101), we get a palindrome (211212212112).

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

Divisors: 1 3 9 1091 3273 9819 10296569 30889707 92669121 11233556779 33700670337 101102011011