Base | Representation |
---|---|
bin | 10110111101101111100110… |
… | …011100100110010100011111 |
3 | 111020121111201012112221202220 |
4 | 112331233212130212110133 |
5 | 101214241021142101421 |
6 | 554450434125320423 |
7 | 30163003463603625 |
oct | 2675574634462437 |
9 | 436544635487686 |
10 | 101000022222111 |
11 | 2a1aa96152a951 |
12 | b3b2593106113 |
13 | 4448351bc245c |
14 | 1ad25da1a1515 |
15 | ba2397e753c6 |
hex | 5bdbe672651f |
101000022222111 has 32 divisors (see below), whose sum is σ = 142839272970240. Its totient is φ = 63303107382144.
The previous prime is 101000022222059. The next prime is 101000022222131. The reversal of 101000022222111 is 111222220000101.
It is not a de Polignac number, because 101000022222111 - 29 = 101000022221599 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101000022222131) 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, 8503540 + ... + 16562313.
It is an arithmetic number, because the mean of its divisors is an integer number (4463727280320).
Almost surely, 2101000022222111 is an apocalyptic number.
101000022222111 is a deficient number, since it is larger than the sum of its proper divisors (41839250748129).
101000022222111 is a wasteful number, since it uses less digits than its factorization.
101000022222111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25066415.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 101000022222111 its reverse (111222220000101), we get a palindrome (212222242222212).
The spelling of 101000022222111 in words is "one hundred one trillion, twenty-two million, two hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.434 sec. • engine limits •