Base | Representation |
---|---|
bin | 1100110111010101001… |
… | …0110100110011000101 |
3 | 210010110122120022001020 |
4 | 3031311102310303011 |
5 | 12110112331414341 |
6 | 245310421021353 |
7 | 21652602133266 |
oct | 3156522646305 |
9 | 703418508036 |
10 | 221011201221 |
11 | 85804074708 |
12 | 36a00254859 |
13 | 17ac2356515 |
14 | a9a87cc96d |
15 | 5b37d85566 |
hex | 33754b4cc5 |
221011201221 has 4 divisors (see below), whose sum is σ = 294681601632. Its totient is φ = 147340800812.
The previous prime is 221011201219. The next prime is 221011201247. The reversal of 221011201221 is 122102110122.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 221011201221 - 21 = 221011201219 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 221011201221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221011201261) 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, 36835200201 + ... + 36835200206.
It is an arithmetic number, because the mean of its divisors is an integer number (73670400408).
Almost surely, 2221011201221 is an apocalyptic number.
It is an amenable number.
221011201221 is a deficient number, since it is larger than the sum of its proper divisors (73670400411).
221011201221 is an equidigital number, since it uses as much as digits as its factorization.
221011201221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 73670400410.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 221011201221 its reverse (122102110122), we get a palindrome (343113311343).
The spelling of 221011201221 in words is "two hundred twenty-one billion, eleven million, two hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •