Search a number
-
+
101102010011011 = 659153417314129
BaseRepresentation
bin10110111111001110100101…
…011001001000110110000011
3111020222020221220120102202201
4112333032211121020312003
5101222423404030323021
6555005342221454031
730203244025525222
oct2677164531106603
9436866856512681
10101102010011011
112a23a137a22199
12b40a2b6711317
134454b56492139
141ad751321ccb9
15ba4d6695e591
hex5bf3a5648d83

101102010011011 has 4 divisors (see below), whose sum is σ = 101255427325800. Its totient is φ = 100948592696224.

The previous prime is 101102010010873. The next prime is 101102010011039. The reversal of 101102010011011 is 110110010201101.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 101102010011011 - 215 = 101102009978243 is a prime.

It is a Duffinian number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 76708656406 + ... + 76708657723.

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

Almost surely, 2101102010011011 is an apocalyptic number.

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

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

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

The sum of its prime factors is 153417314788.

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

Adding to 101102010011011 its reverse (110110010201101), we get a palindrome (211212020212112).

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

Divisors: 1 659 153417314129 101102010011011