Base | Representation |
---|---|
bin | 10110111111001101101001… |
… | …010000000100010001001011 |
3 | 111020222011100120221100212221 |
4 | 112333031221100010101023 |
5 | 101222414322224000021 |
6 | 555005054135114511 |
7 | 30203210024214205 |
oct | 2677155120042113 |
9 | 436864316840787 |
10 | 101101001000011 |
11 | 2a23976a404301 |
12 | b40a074812a37 |
13 | 4454a2541b5cc |
14 | 1ad7459207775 |
15 | ba4d0809d241 |
hex | 5bf36940444b |
101101001000011 has 8 divisors (see below), whose sum is σ = 109659048431184. Its totient is φ = 92833056871680.
The previous prime is 101101000999913. The next prime is 101101001000071. The reversal of 101101001000011 is 110000100101101.
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 101101001000011 - 27 = 101101000999883 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101101000999958 and 101101001000003.
It is not an unprimeable number, because it can be changed into a prime (101101001000071) 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, 72525824985 + ... + 72525826378.
It is an arithmetic number, because the mean of its divisors is an integer number (13707381053898).
Almost surely, 2101101001000011 is an apocalyptic number.
101101001000011 is a deficient number, since it is larger than the sum of its proper divisors (8558047431173).
101101001000011 is a wasteful number, since it uses less digits than its factorization.
101101001000011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 145051651421.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 101101001000011 its reverse (110000100101101), we get a palindrome (211101101101112).
The spelling of 101101001000011 in words is "one hundred one trillion, one hundred one billion, one million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •