Base | Representation |
---|---|
bin | 10110111111010110000001… |
… | …101100011011010000111011 |
3 | 111021000000120211001212002002 |
4 | 112333112001230123100323 |
5 | 101223041240230201021 |
6 | 555013143200531215 |
7 | 30203646040146332 |
oct | 2677260154332073 |
9 | 437000524055062 |
10 | 101110001022011 |
11 | 2a242568710013 |
12 | b40b966920b0b |
13 | 445582aba8907 |
14 | 1ad7a70626d19 |
15 | ba518328150b |
hex | 5bf581b1b43b |
101110001022011 has 8 divisors (see below), whose sum is σ = 105733962954240. Its totient is φ = 96505028667432.
The previous prime is 101110001021999. The next prime is 101110001022047. The reversal of 101110001022011 is 110220100011101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101110001022011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101110001021983 and 101110001022001.
It is not an unprimeable number, because it can be changed into a prime (101110001022911) 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, 4747383521 + ... + 4747404818.
It is an arithmetic number, because the mean of its divisors is an integer number (13216745369280).
Almost surely, 2101110001022011 is an apocalyptic number.
101110001022011 is a deficient number, since it is larger than the sum of its proper divisors (4623961932229).
101110001022011 is an equidigital number, since it uses as much as digits as its factorization.
101110001022011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9494788825.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 101110001022011 its reverse (110220100011101), we get a palindrome (211330101033112).
The spelling of 101110001022011 in words is "one hundred one trillion, one hundred ten billion, one million, twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •