Base | Representation |
---|---|
bin | 1100111011000011100… |
… | …0110000110101111000 |
3 | 210020001022212110012022 |
4 | 3032300320300311320 |
5 | 12114134304032412 |
6 | 245553534134012 |
7 | 22016432245115 |
oct | 3166070606570 |
9 | 706038773168 |
10 | 222011002232 |
11 | 86177471a38 |
12 | 3703b051308 |
13 | 17c21523c56 |
14 | aa614c790c |
15 | 5b95a27a72 |
hex | 33b0e30d78 |
222011002232 has 16 divisors (see below), whose sum is σ = 417430162800. Its totient is φ = 110696292160.
The previous prime is 222011002217. The next prime is 222011002249. The reversal of 222011002232 is 232200110222.
222011002232 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2220110022322 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 222011002232.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 38648069 + ... + 38653812.
It is an arithmetic number, because the mean of its divisors is an integer number (26089385175).
Almost surely, 2222011002232 is an apocalyptic number.
It is an amenable number.
222011002232 is a deficient number, since it is larger than the sum of its proper divisors (195419160568).
222011002232 is a wasteful number, since it uses less digits than its factorization.
222011002232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77302246 (or 77302242 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 17.
Adding to 222011002232 its reverse (232200110222), we get a palindrome (454211112454).
The spelling of 222011002232 in words is "two hundred twenty-two billion, eleven million, two thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •