Base | Representation |
---|---|
bin | 1100111111111110100… |
… | …0000000110011010101 |
3 | 210100110101120122212011 |
4 | 3033333220000303111 |
5 | 12124340443324341 |
6 | 250333004024221 |
7 | 22064242526224 |
oct | 3177750006325 |
9 | 710411518764 |
10 | 223332011221 |
11 | 86795109600 |
12 | 37349532071 |
13 | 180a2106687 |
14 | ab48b16cbb |
15 | 5c219b7b81 |
hex | 33ffa00cd5 |
223332011221 has 12 divisors (see below), whose sum is σ = 245556443916. Its totient is φ = 202966406720.
The previous prime is 223332011207. The next prime is 223332011233. The reversal of 223332011221 is 122110233322.
It can be written as a sum of positive squares in 2 ways, for example, as 195103307025 + 28228704196 = 441705^2 + 168014^2 .
It is not a de Polignac number, because 223332011221 - 29 = 223332010709 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 223332011192 and 223332011201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (223332011251) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 110751 + ... + 677443.
It is an arithmetic number, because the mean of its divisors is an integer number (20463036993).
Almost surely, 2223332011221 is an apocalyptic number.
It is an amenable number.
223332011221 is a deficient number, since it is larger than the sum of its proper divisors (22224432695).
223332011221 is a wasteful number, since it uses less digits than its factorization.
223332011221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 569972 (or 569961 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 223332011221 its reverse (122110233322), we get a palindrome (345442244543).
The spelling of 223332011221 in words is "two hundred twenty-three billion, three hundred thirty-two million, eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •