Base | Representation |
---|---|
bin | 11010100001010… |
… | …00010010110000 |
3 | 120111121022002000 |
4 | 31100220102300 |
5 | 423422310102 |
6 | 34024054000 |
7 | 5340622422 |
oct | 1520502260 |
9 | 514538060 |
10 | 222463152 |
11 | 10463594a |
12 | 62604300 |
13 | 37120902 |
14 | 2178c812 |
15 | 147e501c |
hex | d4284b0 |
222463152 has 80 divisors (see below), whose sum is σ = 643589760. Its totient is φ = 73569600.
The previous prime is 222463151. The next prime is 222463159. The reversal of 222463152 is 251364222.
It is a happy number.
222463152 is a `hidden beast` number, since 2 + 2 + 24 + 631 + 5 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (222463151) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 54627 + ... + 58557.
It is an arithmetic number, because the mean of its divisors is an integer number (8044872).
Almost surely, 2222463152 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 222463152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (321794880).
222463152 is an abundant number, since it is smaller than the sum of its proper divisors (421126608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
222463152 is a wasteful number, since it uses less digits than its factorization.
222463152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4079 (or 4067 counting only the distinct ones).
The product of its digits is 5760, while the sum is 27.
The square root of 222463152 is about 14915.1986912679. The cubic root of 222463152 is about 605.9256844463.
The spelling of 222463152 in words is "two hundred twenty-two million, four hundred sixty-three thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •