Base | Representation |
---|---|
bin | 10110111111010111000011… |
… | …001100101100101011110011 |
3 | 111021000010102101222202212000 |
4 | 112333113003030230223303 |
5 | 101223101013100013021 |
6 | 555013444215505043 |
7 | 30204015213260622 |
oct | 2677270314545363 |
9 | 437003371882760 |
10 | 101111100001011 |
11 | 2a242a81a98221 |
12 | b410012988183 |
13 | 445597478c949 |
14 | 1ad7b3657b6b9 |
15 | ba51e99b4b26 |
hex | 5bf5c332caf3 |
101111100001011 has 8 divisors (see below), whose sum is σ = 149794222223760. Its totient is φ = 67407400000656.
The previous prime is 101111100001001. The next prime is 101111100001033. The reversal of 101111100001011 is 110100001111101.
It is not a de Polignac number, because 101111100001011 - 214 = 101111099984627 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 = 101111100000984 and 101111100001002.
It is not an unprimeable number, because it can be changed into a prime (101111100001001) 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, 1872427777770 + ... + 1872427777823.
It is an arithmetic number, because the mean of its divisors is an integer number (18724277777970).
Almost surely, 2101111100001011 is an apocalyptic number.
101111100001011 is a deficient number, since it is larger than the sum of its proper divisors (48683122222749).
101111100001011 is an equidigital number, since it uses as much as digits as its factorization.
101111100001011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3744855555602 (or 3744855555596 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 101111100001011 its reverse (110100001111101), we get a palindrome (211211101112112).
The spelling of 101111100001011 in words is "one hundred one trillion, one hundred eleven billion, one hundred million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •