Base | Representation |
---|---|
bin | 10110111111010110111101… |
… | …111001100111000011000111 |
3 | 111021000010012012201200211111 |
4 | 112333112331321213003013 |
5 | 101223100322321023421 |
6 | 555013431322345451 |
7 | 30204013053600451 |
oct | 2677267571470307 |
9 | 437003165650744 |
10 | 101111011111111 |
11 | 2a242a368a49a1 |
12 | b40bba905b287 |
13 | 445595c239081 |
14 | 1ad7b2883d2d1 |
15 | ba51e1ca6ee1 |
hex | 5bf5bde670c7 |
101111011111111 has 8 divisors (see below), whose sum is σ = 101123889743520. Its totient is φ = 101098133102592.
The previous prime is 101111011111093. The next prime is 101111011111129. The reversal of 101111011111111 is 111111110111101.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (101111011111093) and next prime (101111011111129).
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-101111011111111 is a prime.
It is a super-2 number, since 2×1011110111111112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
101111011111111 is a modest number, since divided by 11111111 gives 1011110 as remainder.
It is a junction number, because it is equal to n+sod(n) for n = 101111011111091 and 101111011111100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101111011117111) 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, 381789006 + ... + 382053748.
It is an arithmetic number, because the mean of its divisors is an integer number (12640486217940).
Almost surely, 2101111011111111 is an apocalyptic number.
101111011111111 is a deficient number, since it is larger than the sum of its proper divisors (12878632409).
101111011111111 is a wasteful number, since it uses less digits than its factorization.
101111011111111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 311945.
The product of its (nonzero) digits is 1, while the sum is 13.
Adding to 101111011111111 its reverse (111111110111101), we get a palindrome (212222121222212).
It can be divided in two parts, 10111101 and 1111111, that multiplied together give a palindrome (11234555543211).
The spelling of 101111011111111 in words is "one hundred one trillion, one hundred eleven billion, eleven million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •