Base | Representation |
---|---|
bin | 110010000001100101010100… |
… | …101110011111011010000100 |
3 | 1001211222212011022121121201022 |
4 | 302001211110232133122010 |
5 | 212314130234012223022 |
6 | 2055531414101450312 |
7 | 64225164453146225 |
oct | 6201452456373204 |
9 | 1054885138547638 |
10 | 220011121211012 |
11 | 6411421327786a |
12 | 20813767410998 |
13 | 959bc62629441 |
14 | 3c48848ca524c |
15 | 1a67eda458c42 |
hex | c81954b9f684 |
220011121211012 has 6 divisors (see below), whose sum is σ = 385019462119278. Its totient is φ = 110005560605504.
The previous prime is 220011121211009. The next prime is 220011121211017. The reversal of 220011121211012 is 210112121110022.
It can be written as a sum of positive squares in only one way, i.e., 116420129313856 + 103590991897156 = 10789816^2 + 10177966^2 .
It is a super-2 number, since 2×2200111212110122 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (220011121211017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27501390151373 + ... + 27501390151380.
It is an arithmetic number, because the mean of its divisors is an integer number (64169910353213).
Almost surely, 2220011121211012 is an apocalyptic number.
It is an amenable number.
220011121211012 is a deficient number, since it is larger than the sum of its proper divisors (165008340908266).
220011121211012 is a wasteful number, since it uses less digits than its factorization.
220011121211012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55002780302757 (or 55002780302755 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 220011121211012 its reverse (210112121110022), we get a palindrome (430123242321034).
The spelling of 220011121211012 in words is "two hundred twenty trillion, eleven billion, one hundred twenty-one million, two hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •