Base | Representation |
---|---|
bin | 10110111111001100110100… |
… | …110011100011100111100011 |
3 | 111020222002002021021101002110 |
4 | 112333030310303203213203 |
5 | 101222411022001023021 |
6 | 555004430544050403 |
7 | 30203146151246151 |
oct | 2677146463434743 |
9 | 436862067241073 |
10 | 101100121111011 |
11 | 2a239358768710 |
12 | b409a6a003a03 |
13 | 4454915046a29 |
14 | 1ad73b44043d1 |
15 | ba4ca5be5476 |
hex | 5bf334ce39e3 |
101100121111011 has 16 divisors (see below), whose sum is σ = 151029173553408. Its totient is φ = 59616779032800.
The previous prime is 101100121110977. The next prime is 101100121111039. The reversal of 101100121111011 is 110111121001101.
It is not a de Polignac number, because 101100121111011 - 219 = 101100120586723 is a prime.
It is a super-2 number, since 2×1011001211110112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101100121111081) 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, 41400539775 + ... + 41400542216.
It is an arithmetic number, because the mean of its divisors is an integer number (9439323347088).
Almost surely, 2101100121111011 is an apocalyptic number.
101100121111011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
101100121111011 is a deficient number, since it is larger than the sum of its proper divisors (49929052442397).
101100121111011 is a wasteful number, since it uses less digits than its factorization.
101100121111011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82801082042.
The product of its (nonzero) digits is 2, while the sum is 12.
Adding to 101100121111011 its reverse (110111121001101), we get a palindrome (211211242112112).
The spelling of 101100121111011 in words is "one hundred one trillion, one hundred billion, one hundred twenty-one million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •