Base | Representation |
---|---|
bin | 11010100010110… |
… | …11011011100000 |
3 | 120111222221101122 |
4 | 31101123123200 |
5 | 424001010413 |
6 | 34032351412 |
7 | 5342454164 |
oct | 1521333340 |
9 | 514887348 |
10 | 222672608 |
11 | 104769254 |
12 | 626a5568 |
13 | 37195052 |
14 | 21804ca4 |
15 | 14837108 |
hex | d45b6e0 |
222672608 has 36 divisors (see below), whose sum is σ = 446166000. Its totient is φ = 109394496.
The previous prime is 222672601. The next prime is 222672641. The reversal of 222672608 is 806276222.
222672608 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 not an unprimeable number, because it can be changed into a prime (222672601) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 110393 + ... + 112391.
It is an arithmetic number, because the mean of its divisors is an integer number (12393500).
Almost surely, 2222672608 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 222672608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (223083000).
222672608 is an abundant number, since it is smaller than the sum of its proper divisors (223493392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
222672608 is an equidigital number, since it uses as much as digits as its factorization.
222672608 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2127 (or 2060 counting only the distinct ones).
The product of its (nonzero) digits is 32256, while the sum is 35.
The square root of 222672608 is about 14922.2186018032. The cubic root of 222672608 is about 606.1157907754.
The spelling of 222672608 in words is "two hundred twenty-two million, six hundred seventy-two thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •