Base | Representation |
---|---|
bin | 1100010010010001101000… |
… | …0001110111010110000000 |
3 | 1202211100210022221010002010 |
4 | 3010210122001313112000 |
5 | 3232304101330423433 |
6 | 44421312312252520 |
7 | 2562633346451640 |
oct | 304443201672600 |
9 | 52740708833063 |
10 | 13508108842368 |
11 | 4338836316508 |
12 | 1621b663a1140 |
13 | 76ca69a6776a |
14 | 349b20166520 |
15 | 18659c114e63 |
hex | c491a077580 |
13508108842368 has 512 divisors, whose sum is σ = 42696002764800. Its totient is φ = 3702742917120.
The previous prime is 13508108842303. The next prime is 13508108842381. The reversal of 13508108842368 is 86324880180531.
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 63 ways as a sum of consecutive naturals, for example, 7679424273 + ... + 7679426031.
It is an arithmetic number, because the mean of its divisors is an integer number (83390630400).
Almost surely, 213508108842368 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 13508108842368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21348001382400).
13508108842368 is an abundant number, since it is smaller than the sum of its proper divisors (29187893922432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13508108842368 is a wasteful number, since it uses less digits than its factorization.
13508108842368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2558 (or 2546 counting only the distinct ones).
The product of its (nonzero) digits is 8847360, while the sum is 57.
The spelling of 13508108842368 in words is "thirteen trillion, five hundred eight billion, one hundred eight million, eight hundred forty-two thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •