Base | Representation |
---|---|
bin | 110010010001011101010011… |
… | …011011011001001111110011 |
3 | 1001222212010222000020220202122 |
4 | 302101131103123121033303 |
5 | 212440013414401333021 |
6 | 2102124511040504455 |
7 | 64400044125324152 |
oct | 6221352333311763 |
9 | 1058763860226678 |
10 | 221102021121011 |
11 | 644a4927894518 |
12 | 2096b07761b12b |
13 | 964aaa5cab974 |
14 | 3c85575941599 |
15 | 1a8658705bbab |
hex | c917536d93f3 |
221102021121011 has 4 divisors (see below), whose sum is σ = 221102136799872. Its totient is φ = 221101905442152.
The previous prime is 221102021120957. The next prime is 221102021121029. The reversal of 221102021121011 is 110121120201122.
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 221102021121011 - 242 = 216703974609907 is a prime.
It is a super-2 number, since 2×2211020211210112 (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 (221102021181011) 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, 54923411 + ... + 58811436.
It is an arithmetic number, because the mean of its divisors is an integer number (55275534199968).
Almost surely, 2221102021121011 is an apocalyptic number.
221102021121011 is a deficient number, since it is larger than the sum of its proper divisors (115678861).
221102021121011 is a wasteful number, since it uses less digits than its factorization.
221102021121011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115678860.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 221102021121011 its reverse (110121120201122), we get a palindrome (331223141322133).
The spelling of 221102021121011 in words is "two hundred twenty-one trillion, one hundred two billion, twenty-one million, one hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •