Base | Representation |
---|---|
bin | 100000000001110110011… |
… | …111000110111111001001 |
3 | 21210102012020201212020221 |
4 | 200001312133012333021 |
5 | 242030132321401441 |
6 | 4403044110550041 |
7 | 315006051565000 |
oct | 40016637067711 |
9 | 7712166655227 |
10 | 2201011122121 |
11 | 779497441aa9 |
12 | 2b66a2208321 |
13 | 12c7291b5c56 |
14 | 7875ad75c37 |
15 | 3c3c00cd8d1 |
hex | 200767c6fc9 |
2201011122121 has 16 divisors (see below), whose sum is σ = 2590765430400. Its totient is φ = 1868949332880.
The previous prime is 2201011122119. The next prime is 2201011122127. The reversal of 2201011122121 is 1212211101022.
2201011122121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2201011122121 - 21 = 2201011122119 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2201011122095 and 2201011122104.
It is not an unprimeable number, because it can be changed into a prime (2201011122127) 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, 29949010 + ... + 30022411.
It is an arithmetic number, because the mean of its divisors is an integer number (161922839400).
Almost surely, 22201011122121 is an apocalyptic number.
It is an amenable number.
2201011122121 is a deficient number, since it is larger than the sum of its proper divisors (389754308279).
2201011122121 is an equidigital number, since it uses as much as digits as its factorization.
2201011122121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59971549 (or 59971535 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 2201011122121 its reverse (1212211101022), we get a palindrome (3413222223143).
The spelling of 2201011122121 in words is "two trillion, two hundred one billion, eleven million, one hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •