Base | Representation |
---|---|
bin | 10000010101001000011… |
… | …001100011000011111101 |
3 | 10222021121010101120101021 |
4 | 100111020121203003331 |
5 | 121341231441333041 |
6 | 2215310532344141 |
7 | 144035122066621 |
oct | 20251031430375 |
9 | 3867533346337 |
10 | 1122201121021 |
11 | 3a2a173058a2 |
12 | 1615a6a75051 |
13 | 81a914b7886 |
14 | 3c459c3d181 |
15 | 1e2ceaaacd1 |
hex | 105486630fd |
1122201121021 has 8 divisors (see below), whose sum is σ = 1160440025184. Its totient is φ = 1084594265040.
The previous prime is 1122201121007. The next prime is 1122201121031. The reversal of 1122201121021 is 1201211022211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1122201121021 - 27 = 1122201120893 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1122201120986 and 1122201121004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1122201121031) 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, 158008435 + ... + 158015536.
It is an arithmetic number, because the mean of its divisors is an integer number (145055003148).
Almost surely, 21122201121021 is an apocalyptic number.
It is an amenable number.
1122201121021 is a deficient number, since it is larger than the sum of its proper divisors (38238904163).
1122201121021 is an equidigital number, since it uses as much as digits as its factorization.
1122201121021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 316024091.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 1122201121021 its reverse (1201211022211), we get a palindrome (2323412143232).
The spelling of 1122201121021 in words is "one trillion, one hundred twenty-two billion, two hundred one million, one hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •