Base | Representation |
---|---|
bin | 1100000110111110001111… |
… | …1011110100011101110000 |
3 | 1202010210120111222001120111 |
4 | 3001233203323310131300 |
5 | 3221113411001302403 |
6 | 44152200045551104 |
7 | 2542620353465401 |
oct | 301574373643560 |
9 | 52123514861514 |
10 | 13313927759728 |
11 | 4273450144022 |
12 | 15b03b3575494 |
13 | 75766215176b |
14 | 34057cbd79a8 |
15 | 1814d495956d |
hex | c1be3ef4770 |
13313927759728 has 160 divisors (see below), whose sum is σ = 28146373516800. Its totient is φ = 6081634944000.
The previous prime is 13313927759711. The next prime is 13313927759729. The reversal of 13313927759728 is 82795772931331.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13313927759729) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1357035943 + ... + 1357045753.
It is an arithmetic number, because the mean of its divisors is an integer number (175914834480).
Almost surely, 213313927759728 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 13313927759728, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14073186758400).
13313927759728 is an abundant number, since it is smaller than the sum of its proper divisors (14832445757072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13313927759728 is a wasteful number, since it uses less digits than its factorization.
13313927759728 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11231 (or 11225 counting only the distinct ones).
The product of its digits is 120022560, while the sum is 67.
The spelling of 13313927759728 in words is "thirteen trillion, three hundred thirteen billion, nine hundred twenty-seven million, seven hundred fifty-nine thousand, seven hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •