Base | Representation |
---|---|
bin | 11010001101000… |
… | …10001111010000 |
3 | 120022121212010010 |
4 | 31012202033100 |
5 | 422233120122 |
6 | 33451234520 |
7 | 5306261430 |
oct | 1506421720 |
9 | 508555103 |
10 | 219816912 |
11 | 103098777 |
12 | 61748a40 |
13 | 367052a3 |
14 | 212a02c0 |
15 | 14470e0c |
hex | d1a23d0 |
219816912 has 80 divisors (see below), whose sum is σ = 651402752. Its totient is φ = 62570880.
The previous prime is 219816899. The next prime is 219816913. The reversal of 219816912 is 219618912.
219816912 is digitally balanced in base 3, 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 (219816913) 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, 102087 + ... + 104217.
Almost surely, 2219816912 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 219816912, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (325701376).
219816912 is an abundant number, since it is smaller than the sum of its proper divisors (431585840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
219816912 is a wasteful number, since it uses less digits than its factorization.
219816912 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2456 (or 2450 counting only the distinct ones).
The product of its digits is 15552, while the sum is 39.
The square root of 219816912 is about 14826.2237943449. The cubic root of 219816912 is about 603.5135624140.
It can be divided in two parts, 2198 and 16912, that added together give a triangular number (19110 = T195).
The spelling of 219816912 in words is "two hundred nineteen million, eight hundred sixteen thousand, nine hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •