Base | Representation |
---|---|
bin | 10110111111010110001110… |
… | …110000001110000010010011 |
3 | 111021000001011002100012022020 |
4 | 112333112032300032002103 |
5 | 101223042212322321321 |
6 | 555013221024542523 |
7 | 30203654340355521 |
oct | 2677261660160223 |
9 | 437001132305266 |
10 | 101110220120211 |
11 | 2a242670357805 |
12 | b40ba08181a43 |
13 | 44558643bba13 |
14 | 1ad7a9177b311 |
15 | ba519760e4c6 |
hex | 5bf58ec0e093 |
101110220120211 has 8 divisors (see below), whose sum is σ = 135640704292800. Its totient is φ = 66993274680552.
The previous prime is 101110220120209. The next prime is 101110220120233. The reversal of 101110220120211 is 112021022011101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101110220120211 - 21 = 101110220120209 is a prime.
It is a super-2 number, since 2×1011102201202112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101110220120251) 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, 103384682661 + ... + 103384683638.
It is an arithmetic number, because the mean of its divisors is an integer number (16955088036600).
Almost surely, 2101110220120211 is an apocalyptic number.
101110220120211 is a deficient number, since it is larger than the sum of its proper divisors (34530484172589).
101110220120211 is a wasteful number, since it uses less digits than its factorization.
101110220120211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 206769366465.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 101110220120211 its reverse (112021022011101), we get a palindrome (213131242131312).
The spelling of 101110220120211 in words is "one hundred one trillion, one hundred ten billion, two hundred twenty million, one hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •