Base | Representation |
---|---|
bin | 1001010010111100101001… |
… | …0110001011111111111011 |
3 | 1100012010111120022021111100 |
4 | 2110233022112023333323 |
5 | 2314430324213324011 |
6 | 33423304005102443 |
7 | 2103310634414553 |
oct | 224571226137773 |
9 | 40163446267440 |
10 | 10221122011131 |
11 | 3290831a02869 |
12 | 1190b090b7a23 |
13 | 591b0343b925 |
14 | 2749c2524163 |
15 | 12ad1c8b5d56 |
hex | 94bca58bffb |
10221122011131 has 24 divisors (see below), whose sum is σ = 15636492724320. Its totient is φ = 6411534679296.
The previous prime is 10221122011109. The next prime is 10221122011187. The reversal of 10221122011131 is 13111022112201.
It is a happy number.
10221122011131 is a `hidden beast` number, since 102 + 211 + 220 + 1 + 1 + 131 = 666.
It is not a de Polignac number, because 10221122011131 - 27 = 10221122011003 is a prime.
It is a super-2 number, since 2×102211220111312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10221122011231) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8376711 + ... + 9519008.
It is an arithmetic number, because the mean of its divisors is an integer number (651520530180).
Almost surely, 210221122011131 is an apocalyptic number.
10221122011131 is a deficient number, since it is larger than the sum of its proper divisors (5415370713189).
10221122011131 is a wasteful number, since it uses less digits than its factorization.
10221122011131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17899475 (or 17899472 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 10221122011131 its reverse (13111022112201), we get a palindrome (23332144123332).
The spelling of 10221122011131 in words is "ten trillion, two hundred twenty-one billion, one hundred twenty-two million, eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •