Base | Representation |
---|---|
bin | 11010001011011… |
… | …11010000000000 |
3 | 120022020020122000 |
4 | 31011233100000 |
5 | 422204424224 |
6 | 33442544000 |
7 | 5304431514 |
oct | 1505572000 |
9 | 508206560 |
10 | 219608064 |
11 | 102a65875 |
12 | 61668000 |
13 | 36661200 |
14 | 21248144 |
15 | 1442e0c9 |
hex | d16f400 |
219608064 has 264 divisors, whose sum is σ = 719233920. Its totient is φ = 66134016.
The previous prime is 219608063. The next prime is 219608069. The reversal of 219608064 is 460806912.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (219608063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4672489 + ... + 4672535.
Almost surely, 2219608064 is an apocalyptic number.
219608064 is a gapful number since it is divisible by the number (24) 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 219608064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (359616960).
219608064 is an abundant number, since it is smaller than the sum of its proper divisors (499625856).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
219608064 is a wasteful number, since it uses less digits than its factorization.
219608064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102 (or 65 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 36.
The square root of 219608064 is about 14819.1789246233. The cubic root of 219608064 is about 603.3223691491.
The spelling of 219608064 in words is "two hundred nineteen million, six hundred eight thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •