Base | Representation |
---|---|
bin | 1100110010010010011… |
… | …0010000001100111000 |
3 | 202222222022001000012002 |
4 | 3030210212100030320 |
5 | 12044324234332304 |
6 | 244524215040132 |
7 | 21604212403205 |
oct | 3144446201470 |
9 | 688868030162 |
10 | 219657339704 |
11 | 851799294a0 |
12 | 366a2970048 |
13 | 17937a1062a |
14 | a8baa8acac |
15 | 5aa90a631e |
hex | 3324990338 |
219657339704 has 128 divisors (see below), whose sum is σ = 479416320000. Its totient is φ = 93304068480.
The previous prime is 219657339703. The next prime is 219657339739. The reversal of 219657339704 is 407933756912.
It is a self number, because there is not a number n which added to its sum of digits gives 219657339704.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (219657339703) 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, 38006687 + ... + 38012465.
It is an arithmetic number, because the mean of its divisors is an integer number (3745440000).
Almost surely, 2219657339704 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 219657339704, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (239708160000).
219657339704 is an abundant number, since it is smaller than the sum of its proper divisors (259758980296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
219657339704 is a wasteful number, since it uses less digits than its factorization.
219657339704 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6121 (or 6117 counting only the distinct ones).
The product of its (nonzero) digits is 8573040, while the sum is 56.
The spelling of 219657339704 in words is "two hundred nineteen billion, six hundred fifty-seven million, three hundred thirty-nine thousand, seven hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •