Base | Representation |
---|---|
bin | 10000010100000010000… |
… | …000110001101010010101 |
3 | 10222011112211022200121020 |
4 | 100110002000301222111 |
5 | 121331322134101401 |
6 | 2214553425511353 |
7 | 143663632444623 |
oct | 20240200615225 |
9 | 3864484280536 |
10 | 1121020222101 |
11 | 3a2470765a7a |
12 | 1613174a2559 |
13 | 81933950610 |
14 | 3c387082513 |
15 | 1e261094d36 |
hex | 10502031a95 |
1121020222101 has 16 divisors (see below), whose sum is σ = 1609880932800. Its totient is φ = 689768225280.
The previous prime is 1121020222093. The next prime is 1121020222109. The reversal of 1121020222101 is 1012220201211.
It is an interprime number because it is at equal distance from previous prime (1121020222093) and next prime (1121020222109).
It is not a de Polignac number, because 1121020222101 - 23 = 1121020222093 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121020222109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1580635 + ... + 2177256.
It is an arithmetic number, because the mean of its divisors is an integer number (100617558300).
Almost surely, 21121020222101 is an apocalyptic number.
It is an amenable number.
1121020222101 is a deficient number, since it is larger than the sum of its proper divisors (488860710699).
1121020222101 is a wasteful number, since it uses less digits than its factorization.
1121020222101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3765556.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1121020222101 its reverse (1012220201211), we get a palindrome (2133240423312).
The spelling of 1121020222101 in words is "one trillion, one hundred twenty-one billion, twenty million, two hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •