Base | Representation |
---|---|
bin | 10110111111001100101101… |
… | …100101100110001100000011 |
3 | 111020222001202211101212010021 |
4 | 112333030231211212030003 |
5 | 101222410300000323021 |
6 | 555004410540314311 |
7 | 30203143151024011 |
oct | 2677145545461403 |
9 | 436861684355107 |
10 | 101100000011011 |
11 | 2a2392a6375471 |
12 | b409a35542997 |
13 | 44548c5c26221 |
14 | 1ad73a22bd8b1 |
15 | ba4c9a273c41 |
hex | 5bf32d966303 |
101100000011011 has 8 divisors (see below), whose sum is σ = 101127745629504. Its totient is φ = 101072257278720.
The previous prime is 101100000010969. The next prime is 101100000011137. The reversal of 101100000011011 is 110110000001101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101100000011011 - 237 = 100962561057539 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101100000010985 and 101100000011003.
It is not an unprimeable number, because it can be changed into a prime (101100000011711) 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, 70302166 + ... + 71725828.
It is an arithmetic number, because the mean of its divisors is an integer number (12640968203688).
Almost surely, 2101100000011011 is an apocalyptic number.
101100000011011 is a deficient number, since it is larger than the sum of its proper divisors (27745618493).
101100000011011 is a wasteful number, since it uses less digits than its factorization.
101100000011011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1443101.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 101100000011011 its reverse (110110000001101), we get a palindrome (211210000012112).
The spelling of 101100000011011 in words is "one hundred one trillion, one hundred billion, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •