Base | Representation |
---|---|
bin | 1001010010111000100011… |
… | …0010010111010001101101 |
3 | 1100012000122220122001120211 |
4 | 2110232020302113101231 |
5 | 2314421101124213401 |
6 | 33423002514142421 |
7 | 2103241450345021 |
oct | 224561062272155 |
9 | 40160586561524 |
10 | 10220022101101 |
11 | 329031804a10a |
12 | 1190860881a11 |
13 | 5919895bcba7 |
14 | 27491a40a381 |
15 | 12aca604b951 |
hex | 94b88c9746d |
10220022101101 has 8 divisors (see below), whose sum is σ = 10821228149304. Its totient is φ = 9618819194880.
The previous prime is 10220022100997. The next prime is 10220022101111. The reversal of 10220022101101 is 10110122002201.
It can be written as a sum of positive squares in 4 ways, for example, as 3230740225476 + 6989281875625 = 1797426^2 + 2643725^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10220022101101 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10220022101111) 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, 10759981 + ... + 11671213.
It is an arithmetic number, because the mean of its divisors is an integer number (1352653518663).
Almost surely, 210220022101101 is an apocalyptic number.
It is an amenable number.
10220022101101 is a deficient number, since it is larger than the sum of its proper divisors (601206048203).
10220022101101 is an equidigital number, since it uses as much as digits as its factorization.
10220022101101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1570991.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10220022101101 its reverse (10110122002201), we get a palindrome (20330144103302).
The spelling of 10220022101101 in words is "ten trillion, two hundred twenty billion, twenty-two million, one hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •