Base | Representation |
---|---|
bin | 10110111101101111110001… |
… | …101101001001110011000111 |
3 | 111020121112012100222111202210 |
4 | 112331233301231021303013 |
5 | 101214241413021023421 |
6 | 554450504554034503 |
7 | 30163011246253464 |
oct | 2675576155116307 |
9 | 436545170874683 |
10 | 101000211111111 |
11 | 2a1aaa49113a64 |
12 | b3b2626418a33 |
13 | 44483820892b0 |
14 | 1ad26172d066b |
15 | ba23a9837576 |
hex | 5bdbf1b49cc7 |
101000211111111 has 32 divisors (see below), whose sum is σ = 148011462067392. Its totient is φ = 60878423623680.
The previous prime is 101000211111091. The next prime is 101000211111127. The reversal of 101000211111111 is 111111112000101.
It is not a de Polignac number, because 101000211111111 - 219 = 101000210586823 is a prime.
101000211111111 is a modest number, since divided by 11111111 gives 1010002 as remainder.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101000211111131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 39974260 + ... + 42425721.
It is an arithmetic number, because the mean of its divisors is an integer number (4625358189606).
Almost surely, 2101000211111111 is an apocalyptic number.
101000211111111 is a deficient number, since it is larger than the sum of its proper divisors (47011250956281).
101000211111111 is a wasteful number, since it uses less digits than its factorization.
101000211111111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82400643.
The product of its (nonzero) digits is 2, while the sum is 12.
Adding to 101000211111111 its reverse (111111112000101), we get a palindrome (212111323111212).
The spelling of 101000211111111 in words is "one hundred one trillion, two hundred eleven million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •