Base | Representation |
---|---|
bin | 1001010010111000110101… |
… | …1111011010110110110111 |
3 | 1100012000212102010121111011 |
4 | 2110232031133122312313 |
5 | 2314421231330133421 |
6 | 33423014413453051 |
7 | 2103243426222352 |
oct | 224561537326667 |
9 | 40160772117434 |
10 | 10220101021111 |
11 | 3290358652963 |
12 | 11908831a1187 |
13 | 59199ca62817 |
14 | 274926ab1299 |
15 | 12acace3a4e1 |
hex | 94b8d7dadb7 |
10220101021111 has 8 divisors (see below), whose sum is σ = 10232823148704. Its totient is φ = 10207386763680.
The previous prime is 10220101021057. The next prime is 10220101021171. The reversal of 10220101021111 is 11112010102201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10220101021111 - 233 = 10211511086519 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10220101021091 and 10220101021100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10220101021171) 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, 633390 + ... + 4565236.
It is an arithmetic number, because the mean of its divisors is an integer number (1279102893588).
Almost surely, 210220101021111 is an apocalyptic number.
10220101021111 is a deficient number, since it is larger than the sum of its proper divisors (12722127593).
10220101021111 is a wasteful number, since it uses less digits than its factorization.
10220101021111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3935081.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10220101021111 its reverse (11112010102201), we get a palindrome (21332111123312).
The spelling of 10220101021111 in words is "ten trillion, two hundred twenty billion, one hundred one million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •