Base | Representation |
---|---|
bin | 11010001000100… |
… | …01000000111000 |
3 | 120021111122011000 |
4 | 31010101000320 |
5 | 422110101242 |
6 | 33430405000 |
7 | 5301233256 |
oct | 1504210070 |
9 | 507448130 |
10 | 219222072 |
11 | 102821873 |
12 | 61500760 |
13 | 36557604 |
14 | 211875d6 |
15 | 143a4a4c |
hex | d111038 |
219222072 has 128 divisors (see below), whose sum is σ = 650073600. Its totient is φ = 68212224.
The previous prime is 219222071. The next prime is 219222079. The reversal of 219222072 is 270222912.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (219222071) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 833413 + ... + 833675.
It is an arithmetic number, because the mean of its divisors is an integer number (5078700).
Almost surely, 2219222072 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 219222072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (325036800).
219222072 is an abundant number, since it is smaller than the sum of its proper divisors (430851528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
219222072 is a wasteful number, since it uses less digits than its factorization.
219222072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 522 (or 512 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 27.
The square root of 219222072 is about 14806.1498033756. The cubic root of 219222072 is about 602.9686872679.
Adding to 219222072 its reverse (270222912), we get a palindrome (489444984).
The spelling of 219222072 in words is "two hundred nineteen million, two hundred twenty-two thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •