Search a number
-
+
101100110110011 = 341248149507531
BaseRepresentation
bin10110111111001100110100…
…001001100101110100111011
3111020222002001111120110120000
4112333030310021211310323
5101222411011142010021
6555004425512204043
730203145655610235
oct2677146411456473
9436862044513500
10101100110110011
112a239352534481
12b409a66399623
13445491299466c
141ad73b2b7d255
15ba4ca4c70b26
hex5bf334265d3b

101100110110011 has 10 divisors (see below), whose sum is σ = 151026090411372. Its totient is φ = 67400073406620.

The previous prime is 101100110110003. The next prime is 101100110110033. The reversal of 101100110110011 is 110011011001101.

It is not a de Polignac number, because 101100110110011 - 23 = 101100110110003 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 = 101100110109975 and 101100110110002.

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

It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 624074753685 + ... + 624074753846.

Almost surely, 2101100110110011 is an apocalyptic number.

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

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

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

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

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

Adding to 101100110110011 its reverse (110011011001101), we get a palindrome (211111121111112).

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

Divisors: 1 3 9 27 81 1248149507531 3744448522593 11233345567779 33700036703337 101100110110011