Base | Representation |
---|---|
bin | 110010001111111111011010… |
… | …101011110000110101110011 |
3 | 1001222111111202101110022101221 |
4 | 302033333122223300311303 |
5 | 212431340440021333021 |
6 | 2102010315500405511 |
7 | 64356545014422466 |
oct | 6217773253606563 |
9 | 1058444671408357 |
10 | 221001211121011 |
11 | 644660a6208432 |
12 | 20953622546897 |
13 | 964142b7277a9 |
14 | 3c807310b12dd |
15 | 1a83b36b72241 |
hex | c8ffdaaf0d73 |
221001211121011 has 4 divisors (see below), whose sum is σ = 222484440726000. Its totient is φ = 219517981516024.
The previous prime is 221001211121003. The next prime is 221001211121071. The reversal of 221001211121011 is 110121112100122.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 221001211121011 - 23 = 221001211121003 is a prime.
It is a super-2 number, since 2×2210012111210112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (221001211121071) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 741614802271 + ... + 741614802568.
It is an arithmetic number, because the mean of its divisors is an integer number (55621110181500).
Almost surely, 2221001211121011 is an apocalyptic number.
221001211121011 is a deficient number, since it is larger than the sum of its proper divisors (1483229604989).
221001211121011 is a wasteful number, since it uses less digits than its factorization.
221001211121011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1483229604988.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 221001211121011 its reverse (110121112100122), we get a palindrome (331122323221133).
The spelling of 221001211121011 in words is "two hundred twenty-one trillion, one billion, two hundred eleven million, one hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •