Base | Representation |
---|---|
bin | 1001010011000000101010… |
… | …1110011100010000100011 |
3 | 1100012020021211201000222121 |
4 | 2110300022232130100203 |
5 | 2314440032220023021 |
6 | 33424003111245111 |
7 | 2103346461206032 |
oct | 224601256342043 |
9 | 40166254630877 |
10 | 10222202111011 |
11 | 32912366658a0 |
12 | 119116a979797 |
13 | 591c46142797 |
14 | 274a85b62719 |
15 | 12ad8261a741 |
hex | 94c0ab9c423 |
10222202111011 has 8 divisors (see below), whose sum is σ = 11171091625200. Its totient is φ = 9276578999040.
The previous prime is 10222202110997. The next prime is 10222202111071. The reversal of 10222202111011 is 11011120222201.
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-10222202111011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10222202111071) 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, 816594006 + ... + 816606523.
It is an arithmetic number, because the mean of its divisors is an integer number (1396386453150).
Almost surely, 210222202111011 is an apocalyptic number.
10222202111011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10222202111011 is a deficient number, since it is larger than the sum of its proper divisors (948889514189).
10222202111011 is a wasteful number, since it uses less digits than its factorization.
10222202111011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1633201109.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 10222202111011 its reverse (11011120222201), we get a palindrome (21233322333212).
The spelling of 10222202111011 in words is "ten trillion, two hundred twenty-two billion, two hundred two million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •