Base | Representation |
---|---|
bin | 10110111110000010001101… |
… | …110111110001110000100111 |
3 | 111020200102022020222122102102 |
4 | 112332002031313301300213 |
5 | 101220102440304323421 |
6 | 554503541414402315 |
7 | 30164312021525453 |
oct | 2676021567616047 |
9 | 436612266878372 |
10 | 101020011011111 |
11 | 2a2083896a1985 |
12 | b3b643136039b |
13 | 444a1b917325a |
14 | 1ad3574ba9663 |
15 | ba2b67c2960b |
hex | 5be08ddf1c27 |
101020011011111 has 4 divisors (see below), whose sum is σ = 101020039165752. Its totient is φ = 101019982856472.
The previous prime is 101020011011077. The next prime is 101020011011159. The reversal of 101020011011111 is 111110110020101.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101020011011111 - 218 = 101020010748967 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101020011011092 and 101020011011101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101020011011191) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7746116 + ... + 16187721.
It is an arithmetic number, because the mean of its divisors is an integer number (25255009791438).
Almost surely, 2101020011011111 is an apocalyptic number.
101020011011111 is a deficient number, since it is larger than the sum of its proper divisors (28154641).
101020011011111 is an equidigital number, since it uses as much as digits as its factorization.
101020011011111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28154640.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 101020011011111 its reverse (111110110020101), we get a palindrome (212130121031212).
The spelling of 101020011011111 in words is "one hundred one trillion, twenty billion, eleven million, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •