Base | Representation |
---|---|
bin | 10110111111001100101110… |
… | …001111111001101101010011 |
3 | 111020222001210121021021202000 |
4 | 112333030232033321231103 |
5 | 101222410310320213021 |
6 | 555004412014125043 |
7 | 30203143344213246 |
oct | 2677145617715523 |
9 | 436861717237660 |
10 | 101100011101011 |
11 | 2a23930165a55a |
12 | b409a391b0783 |
13 | 44548c8309c60 |
14 | 1ad73a396925d |
15 | ba4c9b214b26 |
hex | 5bf32e3f9b53 |
101100011101011 has 128 divisors (see below), whose sum is σ = 163414056960000. Its totient is φ = 61406690260608.
The previous prime is 101100011101009. The next prime is 101100011101091. The reversal of 101100011101011 is 110101110001101.
It is not a de Polignac number, because 101100011101011 - 21 = 101100011101009 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 = 101100011100984 and 101100011101002.
It is not an unprimeable number, because it can be changed into a prime (101100011101091) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 4390487080 + ... + 4390510106.
It is an arithmetic number, because the mean of its divisors is an integer number (1276672320000).
Almost surely, 2101100011101011 is an apocalyptic number.
101100011101011 is a deficient number, since it is larger than the sum of its proper divisors (62314045858989).
101100011101011 is a wasteful number, since it uses less digits than its factorization.
101100011101011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23750 (or 23744 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 101100011101011 its reverse (110101110001101), we get a palindrome (211201121102112).
The spelling of 101100011101011 in words is "one hundred one trillion, one hundred billion, eleven million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •