Base | Representation |
---|---|
bin | 1100110010111100110… |
… | …0110100000000000000 |
3 | 210000102200202021001000 |
4 | 3030233030310000000 |
5 | 12100210304014333 |
6 | 244554011412000 |
7 | 21611502352440 |
oct | 3145714640000 |
9 | 700380667030 |
10 | 219835219968 |
11 | 85260283581 |
12 | 36732454000 |
13 | 17965821720 |
14 | a8d6552120 |
15 | 5ab99e1713 |
hex | 332f334000 |
219835219968 has 960 divisors, whose sum is σ = 826755973120. Its totient is φ = 56184274944.
The previous prime is 219835219921. The next prime is 219835219973. The reversal of 219835219968 is 869912538912.
219835219968 is a `hidden beast` number, since 2 + 1 + 98 + 352 + 199 + 6 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1730985921 + ... + 1730986047.
Almost surely, 2219835219968 is an apocalyptic number.
219835219968 is a gapful number since it is divisible by the number (28) 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 219835219968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (413377986560).
219835219968 is an abundant number, since it is smaller than the sum of its proper divisors (606920753152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
219835219968 is a wasteful number, since it uses less digits than its factorization.
219835219968 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 227 (or 195 counting only the distinct ones).
The product of its digits is 16796160, while the sum is 63.
The spelling of 219835219968 in words is "two hundred nineteen billion, eight hundred thirty-five million, two hundred nineteen thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •