Base | Representation |
---|---|
bin | 10110111101101111101100… |
… | …010001101011010001011111 |
3 | 111020121111222000120201011010 |
4 | 112331233230101223101133 |
5 | 101214241221211201421 |
6 | 554450451541430303 |
7 | 30163006062104052 |
oct | 2675575421532137 |
9 | 436544860521133 |
10 | 101000120022111 |
11 | 2a1aaa017594a2 |
12 | b3b25bba0b393 |
13 | 444836924578b |
14 | 1ad260917ca99 |
15 | ba23a1843076 |
hex | 5bdbec46b45f |
101000120022111 has 8 divisors (see below), whose sum is σ = 134666948079664. Its totient is φ = 67333352656320.
The previous prime is 101000120022091. The next prime is 101000120022143. The reversal of 101000120022111 is 111220021000101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101000120022111 - 214 = 101000120005727 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101000120022611) 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 7 ways as a sum of consecutive naturals, for example, 11136526 + ... + 18056091.
It is an arithmetic number, because the mean of its divisors is an integer number (16833368509958).
Almost surely, 2101000120022111 is an apocalyptic number.
101000120022111 is a deficient number, since it is larger than the sum of its proper divisors (33666828057553).
101000120022111 is a wasteful number, since it uses less digits than its factorization.
101000120022111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30345881.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101000120022111 its reverse (111220021000101), we get a palindrome (212220141022212).
The spelling of 101000120022111 in words is "one hundred one trillion, one hundred twenty million, twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •