Base | Representation |
---|---|
bin | 1000110111100010110110… |
… | …11001111101111011100100 |
3 | 2120001020200021022100000000 |
4 | 10123301123121331323210 |
5 | 10023444400333322024 |
6 | 105250254022021300 |
7 | 4051610104031211 |
oct | 433613331757344 |
9 | 76036607270000 |
10 | 19500685057764 |
11 | 6239215373689 |
12 | 222b443b77830 |
13 | ab5ba30730b1 |
14 | 4b5ba4002b08 |
15 | 23c3ce472cc9 |
hex | 11bc5b67dee4 |
19500685057764 has 81 divisors (see below), whose sum is σ = 51188575450467. Its totient is φ = 6499989890856.
The previous prime is 19500685057753. The next prime is 19500685057829. The reversal of 19500685057764 is 46775058600591.
The square root of 19500685057764 is 4415958.
It is a perfect power (a square), and thus also a powerful number.
19500685057764 is a `hidden beast` number, since 1 + 9 + 5 + 0 + 0 + 6 + 8 + 50 + 577 + 6 + 4 = 666.
It is a tau number, because it is divible by the number of its divisors (81).
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 715371567 + ... + 715398825.
Almost surely, 219500685057764 is an apocalyptic number.
19500685057764 is the 4415958-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 19500685057764
19500685057764 is an abundant number, since it is smaller than the sum of its proper divisors (31687890392703).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19500685057764 is an frugal number, since it uses more digits than its factorization.
19500685057764 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54546 (or 27264 counting only the distinct ones).
The product of its (nonzero) digits is 63504000, while the sum is 63.
The spelling of 19500685057764 in words is "nineteen trillion, five hundred billion, six hundred eighty-five million, fifty-seven thousand, seven hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •