Base | Representation |
---|---|
bin | 10000010101001001100… |
… | …001100100011011111110 |
3 | 10222021122102220202212120 |
4 | 100111021201210123332 |
5 | 121341301310013042 |
6 | 2215312445143410 |
7 | 144035441422431 |
oct | 20251141443376 |
9 | 3867572822776 |
10 | 1122220001022 |
11 | 3a2a26a306aa |
12 | 1615b125ab66 |
13 | 81a95398283 |
14 | 3c45c555818 |
15 | 1e2d1589dec |
hex | 105498646fe |
1122220001022 has 8 divisors (see below), whose sum is σ = 2244440002056. Its totient is φ = 374073333672.
The previous prime is 1122220000987. The next prime is 1122220001059. The reversal of 1122220001022 is 2201000222211.
It is a sphenic number, since it is the product of 3 distinct primes.
1122220001022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 1122220000992 and 1122220001010.
It is a congruent number.
It is an unprimeable number.
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 in 3 ways as a sum of consecutive naturals, for example, 93518333413 + ... + 93518333424.
It is an arithmetic number, because the mean of its divisors is an integer number (280555000257).
Almost surely, 21122220001022 is an apocalyptic number.
1122220001022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1122220001022 is a wasteful number, since it uses less digits than its factorization.
1122220001022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 187036666842.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 1122220001022 its reverse (2201000222211), we get a palindrome (3323220223233).
The spelling of 1122220001022 in words is "one trillion, one hundred twenty-two billion, two hundred twenty million, one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •