Base | Representation |
---|---|
bin | 1001010010111100100110… |
… | …1100001110011100110010 |
3 | 1100012010110210121102022121 |
4 | 2110233021230032130302 |
5 | 2314430313404323442 |
6 | 33423302533224454 |
7 | 2103310442051554 |
oct | 224571154163462 |
9 | 40163423542277 |
10 | 10221111011122 |
11 | 329082677a350 |
12 | 1190b0549212a |
13 | 591b01089b4b |
14 | 2749c0c9d4d4 |
15 | 12ad1b941967 |
hex | 94bc9b0e732 |
10221111011122 has 32 divisors (see below), whose sum is σ = 16896257342784. Its totient is φ = 4598542632000.
The previous prime is 10221111011087. The next prime is 10221111011123. The reversal of 10221111011122 is 22111011112201.
10221111011122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×102211110111222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10221111011096 and 10221111011105.
It is not an unprimeable number, because it can be changed into a prime (10221111011123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6521133 + ... + 7935199.
It is an arithmetic number, because the mean of its divisors is an integer number (528008041962).
Almost surely, 210221111011122 is an apocalyptic number.
10221111011122 is a deficient number, since it is larger than the sum of its proper divisors (6675146331662).
10221111011122 is a wasteful number, since it uses less digits than its factorization.
10221111011122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1417434.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 10221111011122 its reverse (22111011112201), we get a palindrome (32332122123323).
The spelling of 10221111011122 in words is "ten trillion, two hundred twenty-one billion, one hundred eleven million, eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •