Base | Representation |
---|---|
bin | 1000111100111100010010… |
… | …10110111100010100000000 |
3 | 2120200222100220202201202111 |
4 | 10132132021112330110000 |
5 | 10040014203220012433 |
6 | 105511404312425104 |
7 | 4101163614516100 |
oct | 436361126742400 |
9 | 76628326681674 |
10 | 19686139610368 |
11 | 62aa932658980 |
12 | 225b3803a8194 |
13 | aca519a7815a |
14 | 4c0b583c5200 |
15 | 24213596edcd |
hex | 11e7895bc500 |
19686139610368 has 648 divisors, whose sum is σ = 52891389349344. Its totient is φ = 7230079180800.
The previous prime is 19686139610297. The next prime is 19686139610369. The reversal of 19686139610368 is 86301693168691.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19686139610369) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 11307373978 + ... + 11307375718.
It is an arithmetic number, because the mean of its divisors is an integer number (81622514428).
Almost surely, 219686139610368 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 19686139610368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26445694674672).
19686139610368 is an abundant number, since it is smaller than the sum of its proper divisors (33205249738976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19686139610368 is a wasteful number, since it uses less digits than its factorization.
19686139610368 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2047 (or 2007 counting only the distinct ones).
The product of its (nonzero) digits is 60466176, while the sum is 67.
The spelling of 19686139610368 in words is "nineteen trillion, six hundred eighty-six billion, one hundred thirty-nine million, six hundred ten thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •