Base | Representation |
---|---|
bin | 10110111111001100110011… |
… | …100110111000011001000011 |
3 | 111020222002000212110012002000 |
4 | 112333030303212320121003 |
5 | 101222411001324323021 |
6 | 555004424545155043 |
7 | 30203145515352444 |
oct | 2677146346703103 |
9 | 436862025405060 |
10 | 101100101011011 |
11 | 2a23934838a243 |
12 | b409a6332ba83 |
13 | 4454910b29c3b |
14 | 1ad73b18912cb |
15 | ba4ca4074b26 |
hex | 5bf3339b8643 |
101100101011011 has 8 divisors (see below), whose sum is σ = 149777927423760. Its totient is φ = 67400067340656.
The previous prime is 101100101011009. The next prime is 101100101011081. The reversal of 101100101011011 is 110110101001101.
It is not a de Polignac number, because 101100101011011 - 21 = 101100101011009 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 = 101100101010984 and 101100101011002.
It is not an unprimeable number, because it can be changed into a prime (101100101011081) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1872224092770 + ... + 1872224092823.
It is an arithmetic number, because the mean of its divisors is an integer number (18722240927970).
Almost surely, 2101100101011011 is an apocalyptic number.
101100101011011 is a deficient number, since it is larger than the sum of its proper divisors (48677826412749).
101100101011011 is an equidigital number, since it uses as much as digits as its factorization.
101100101011011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3744448185602 (or 3744448185596 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 101100101011011 its reverse (110110101001101), we get a palindrome (211210202012112).
The spelling of 101100101011011 in words is "one hundred one trillion, one hundred billion, one hundred one million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •