Base | Representation |
---|---|
bin | 11010100010000… |
… | …01111001111100 |
3 | 120111210121222111 |
4 | 31101001321330 |
5 | 423434134220 |
6 | 34030223404 |
7 | 5341540321 |
oct | 1521017174 |
9 | 514717874 |
10 | 222568060 |
11 | 1046a7750 |
12 | 62654b64 |
13 | 371595a0 |
14 | 217b8b48 |
15 | 1481615a |
hex | d441e7c |
222568060 has 96 divisors (see below), whose sum is σ = 558835200. Its totient is φ = 73386240.
The previous prime is 222568013. The next prime is 222568091. The reversal of 222568060 is 60865222.
222568060 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 168081 + ... + 169399.
It is an arithmetic number, because the mean of its divisors is an integer number (5821200).
Almost surely, 2222568060 is an apocalyptic number.
222568060 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 222568060, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (279417600).
222568060 is an abundant number, since it is smaller than the sum of its proper divisors (336267140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
222568060 is a wasteful number, since it uses less digits than its factorization.
222568060 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1411 (or 1409 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 31.
The square root of 222568060 is about 14918.7150921251. The cubic root of 222568060 is about 606.0209158912.
The spelling of 222568060 in words is "two hundred twenty-two million, five hundred sixty-eight thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •