Base | Representation |
---|---|
bin | 1100100011000110001101… |
… | …1001111110000000000000 |
3 | 1210211222201210212112000102 |
4 | 3020301203121332000000 |
5 | 3302022431243103223 |
6 | 45202145041541532 |
7 | 2622544031665220 |
oct | 310614331760000 |
9 | 53758653775012 |
10 | 13797102706688 |
11 | 443a355874104 |
12 | 1669b799448a8 |
13 | 7910a4601042 |
14 | 359ad767c080 |
15 | 18dd63421928 |
hex | c8c6367e000 |
13797102706688 has 448 divisors, whose sum is σ = 36281870438400. Its totient is φ = 5102024785920.
The previous prime is 13797102706679. The next prime is 13797102706703. The reversal of 13797102706688 is 88660720179731.
It is a tau number, because it is divible by the number of its divisors (448).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 574173458 + ... + 574197486.
Almost surely, 213797102706688 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 13797102706688, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18140935219200).
13797102706688 is an abundant number, since it is smaller than the sum of its proper divisors (22484767731712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13797102706688 is a wasteful number, since it uses less digits than its factorization.
13797102706688 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24129 (or 24105 counting only the distinct ones).
The product of its (nonzero) digits is 42674688, while the sum is 65.
The spelling of 13797102706688 in words is "thirteen trillion, seven hundred ninety-seven billion, one hundred two million, seven hundred six thousand, six hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •