Base | Representation |
---|---|
bin | 10000010101000010011… |
… | …011100111101110100010 |
3 | 10222021100010222221200212 |
4 | 100111002123213232202 |
5 | 121341030324013442 |
6 | 2215252554414122 |
7 | 144032465065103 |
oct | 20250233475642 |
9 | 3867303887625 |
10 | 1122101001122 |
11 | 3a2975842282 |
12 | 161579431342 |
13 | 81a7683162a |
14 | 3c44a81a3aa |
15 | 1e2c5dd0a82 |
hex | 105426e7ba2 |
1122101001122 has 4 divisors (see below), whose sum is σ = 1683151501686. Its totient is φ = 561050500560.
The previous prime is 1122101001121. The next prime is 1122101001187. The reversal of 1122101001122 is 2211001012211.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 1022365676641 + 99735324481 = 1011121^2 + 315809^2 .
It is a super-2 number, since 2×11221010011222 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1122101001097 and 1122101001106.
It is not an unprimeable number, because it can be changed into a prime (1122101001121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 280525250279 + ... + 280525250282.
Almost surely, 21122101001122 is an apocalyptic number.
1122101001122 is a deficient number, since it is larger than the sum of its proper divisors (561050500564).
1122101001122 is an equidigital number, since it uses as much as digits as its factorization.
1122101001122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 561050500563.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1122101001122 its reverse (2211001012211), we get a palindrome (3333102013333).
The spelling of 1122101001122 in words is "one trillion, one hundred twenty-two billion, one hundred one million, one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •