Base | Representation |
---|---|
bin | 1100111110110111000… |
… | …0010101000000000101 |
3 | 210022200111102201212002 |
4 | 3033231300111000011 |
5 | 12123232220414341 |
6 | 250243134035045 |
7 | 22053642300464 |
oct | 3175560250005 |
9 | 708614381762 |
10 | 223032201221 |
11 | 86650954945 |
12 | 37285048a85 |
13 | 18054c741cb |
14 | ab1ad929db |
15 | 5c054e529b |
hex | 33edc15005 |
223032201221 has 16 divisors (see below), whose sum is σ = 236753798400. Its totient is φ = 209674700928.
The previous prime is 223032201193. The next prime is 223032201253. The reversal of 223032201221 is 122102230322.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-223032201221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 223032201193 and 223032201202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (223032201121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15635 + ... + 668063.
It is an arithmetic number, because the mean of its divisors is an integer number (14797112400).
Almost surely, 2223032201221 is an apocalyptic number.
It is an amenable number.
223032201221 is a deficient number, since it is larger than the sum of its proper divisors (13721597179).
223032201221 is a wasteful number, since it uses less digits than its factorization.
223032201221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 652708.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 223032201221 its reverse (122102230322), we get a palindrome (345134431543).
The spelling of 223032201221 in words is "two hundred twenty-three billion, thirty-two million, two hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •