Base | Representation |
---|---|
bin | 1001010010111001001101… |
… | …1101001100011100111001 |
3 | 1100012001010101110012102220 |
4 | 2110232103131030130321 |
5 | 2314421432440213423 |
6 | 33423032350514253 |
7 | 2103246052666653 |
oct | 224562335143471 |
9 | 40161111405386 |
10 | 10220201101113 |
11 | 32903aa099503 |
12 | 11908b0805989 |
13 | 5919b7703863 |
14 | 2749360c36d3 |
15 | 12acb6b089e3 |
hex | 94b9374c739 |
10220201101113 has 16 divisors (see below), whose sum is σ = 13657754088000. Its totient is φ = 6798058803200.
The previous prime is 10220201101091. The next prime is 10220201101129. The reversal of 10220201101113 is 31110110202201.
It is a cyclic number.
It is not a de Polignac number, because 10220201101113 - 210 = 10220201100089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10220201101092 and 10220201101101.
It is not an unprimeable number, because it can be changed into a prime (10220201101133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 44780338 + ... + 45007988.
It is an arithmetic number, because the mean of its divisors is an integer number (853609630500).
Almost surely, 210220201101113 is an apocalyptic number.
It is an amenable number.
10220201101113 is a deficient number, since it is larger than the sum of its proper divisors (3437552986887).
10220201101113 is a wasteful number, since it uses less digits than its factorization.
10220201101113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 261432.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 10220201101113 its reverse (31110110202201), we get a palindrome (41330311303314).
The spelling of 10220201101113 in words is "ten trillion, two hundred twenty billion, two hundred one million, one hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •