Base | Representation |
---|---|
bin | 10110111111001101101111… |
… | …110011101011101111001011 |
3 | 111020222011122020220221112000 |
4 | 112333031233303223233023 |
5 | 101222420033404000021 |
6 | 555005113104522043 |
7 | 30203212531206003 |
oct | 2677155763535713 |
9 | 436864566827460 |
10 | 101101111000011 |
11 | 2a2398165059a1 |
12 | b40a0a5620323 |
13 | 4454a42153975 |
14 | 1ad7469a7d003 |
15 | ba4d12a7ab26 |
hex | 5bf36fcebbcb |
101101111000011 has 16 divisors (see below), whose sum is σ = 149780143989120. Its totient is φ = 67400416538280.
The previous prime is 101101110999979. The next prime is 101101111000039. The reversal of 101101111000011 is 110000111101101.
It is not a de Polignac number, because 101101111000011 - 25 = 101101110999979 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 = 101101110999957 and 101101111000002.
It is not an unprimeable number, because it can be changed into a prime (101101111000051) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3217485 + ... + 14579246.
It is an arithmetic number, because the mean of its divisors is an integer number (9361258999320).
Almost surely, 2101101111000011 is an apocalyptic number.
101101111000011 is a deficient number, since it is larger than the sum of its proper divisors (48679032989109).
101101111000011 is a wasteful number, since it uses less digits than its factorization.
101101111000011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18007143 (or 18007137 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 101101111000011 its reverse (110000111101101), we get a palindrome (211101222101112).
The spelling of 101101111000011 in words is "one hundred one trillion, one hundred one billion, one hundred eleven million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •