Base | Representation |
---|---|
bin | 10000010100001000000… |
… | …101110101100101101001 |
3 | 10222011210221020022201100 |
4 | 100110020011311211221 |
5 | 121332024241242301 |
6 | 2215011511512013 |
7 | 143666311366065 |
oct | 20241005654551 |
9 | 3864727208640 |
10 | 1121122212201 |
11 | 3a2513296712 |
12 | 161345688609 |
13 | 8194bb0cba4 |
14 | 3c396830aa5 |
15 | 1e269ede286 |
hex | 10508175969 |
1121122212201 has 12 divisors (see below), whose sum is σ = 1630267200900. Its totient is φ = 742398600480.
The previous prime is 1121122212169. The next prime is 1121122212229. The reversal of 1121122212201 is 1022122211211.
1121122212201 is a `hidden beast` number, since 11 + 211 + 2 + 221 + 220 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 372680946576 + 748441265625 = 610476^2 + 865125^2 .
It is not a de Polignac number, because 1121122212201 - 25 = 1121122212169 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1121122212251) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 418015890 + ... + 418018571.
It is an arithmetic number, because the mean of its divisors is an integer number (135855600075).
Almost surely, 21121122212201 is an apocalyptic number.
It is an amenable number.
1121122212201 is a deficient number, since it is larger than the sum of its proper divisors (509144988699).
1121122212201 is a wasteful number, since it uses less digits than its factorization.
1121122212201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 836034616 (or 836034613 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 1121122212201 its reverse (1022122211211), we get a palindrome (2143244423412).
The spelling of 1121122212201 in words is "one trillion, one hundred twenty-one billion, one hundred twenty-two million, two hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •