Base | Representation |
---|---|
bin | 10000010101001000011… |
… | …001111011011110011101 |
3 | 10222021121010120122112222 |
4 | 100111020121323132131 |
5 | 121341232003033041 |
6 | 2215310534435125 |
7 | 144035122664306 |
oct | 20251031733635 |
9 | 3867533518488 |
10 | 1122201221021 |
11 | 3a2a17373a41 |
12 | 1615a6b02aa5 |
13 | 81a9152124a |
14 | 3c459c677ad |
15 | 1e2ceaca74b |
hex | 1054867b79d |
1122201221021 has 8 divisors (see below), whose sum is σ = 1185296068320. Its totient is φ = 1059509536272.
The previous prime is 1122201220991. The next prime is 1122201221023. The reversal of 1122201221021 is 1201221022211.
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 1122201221021 - 218 = 1122200958877 is a prime.
It is a super-2 number, since 2×11222012210212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1122201221023) 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, 100784915 + ... + 100796048.
It is an arithmetic number, because the mean of its divisors is an integer number (148162008540).
Almost surely, 21122201221021 is an apocalyptic number.
It is an amenable number.
1122201221021 is a deficient number, since it is larger than the sum of its proper divisors (63094847299).
1122201221021 is a wasteful number, since it uses less digits than its factorization.
1122201221021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201581275.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 1122201221021 its reverse (1201221022211), we get a palindrome (2323422243232).
The spelling of 1122201221021 in words is "one trillion, one hundred twenty-two billion, two hundred one million, two hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •