Base | Representation |
---|---|
bin | 1011111000101101001001… |
… | …1011010010011110000000 |
3 | 1201021100220121010122011020 |
4 | 2332023102123102132000 |
5 | 3203104421121231303 |
6 | 43443422230545440 |
7 | 2516122364431200 |
oct | 276132233223600 |
9 | 51240817118136 |
10 | 13068820883328 |
11 | 4189501759a81 |
12 | 15709a9808280 |
13 | 73a4cca40aa2 |
14 | 33276a1c6400 |
15 | 179e3b4d4a53 |
hex | be2d26d2780 |
13068820883328 has 192 divisors, whose sum is σ = 40387205653200. Its totient is φ = 3733435711488.
The previous prime is 13068820883323. The next prime is 13068820883357. The reversal of 13068820883328 is 82338802886031.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (192).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13068820883323) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 149298838 + ... + 149386346.
Almost surely, 213068820883328 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 13068820883328, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20193602826600).
13068820883328 is an abundant number, since it is smaller than the sum of its proper divisors (27318384769872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13068820883328 is an equidigital number, since it uses as much as digits as its factorization.
13068820883328 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95477 (or 95458 counting only the distinct ones).
The product of its (nonzero) digits is 21233664, while the sum is 60.
The spelling of 13068820883328 in words is "thirteen trillion, sixty-eight billion, eight hundred twenty million, eight hundred eighty-three thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •