Base | Representation |
---|---|
bin | 1011111100110101110001… |
… | …0100001111000110000000 |
3 | 1201112011021000001000010010 |
4 | 2333031130110033012000 |
5 | 3210240410031021130 |
6 | 43540210540104520 |
7 | 2524215553120500 |
oct | 277153424170600 |
9 | 51464230030103 |
10 | 13139853767040 |
11 | 4206642994950 |
12 | 1582712535140 |
13 | 74411016a020 |
14 | 335d88069a00 |
15 | 17bbe76200b0 |
hex | bf35c50f180 |
13139853767040 has 1536 divisors, whose sum is σ = 59214613248000. Its totient is φ = 2433351352320.
The previous prime is 13139853767003. The next prime is 13139853767063. The reversal of 13139853767040 is 4076735893131.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 390132921 + ... + 390166599.
It is an arithmetic number, because the mean of its divisors is an integer number (38551180500).
Almost surely, 213139853767040 is an apocalyptic number.
13139853767040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13139853767040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29607306624000).
13139853767040 is an abundant number, since it is smaller than the sum of its proper divisors (46074759480960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13139853767040 is a wasteful number, since it uses less digits than its factorization.
13139853767040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33768 (or 33749 counting only the distinct ones).
The product of its (nonzero) digits is 11430720, while the sum is 57.
The spelling of 13139853767040 in words is "thirteen trillion, one hundred thirty-nine billion, eight hundred fifty-three million, seven hundred sixty-seven thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •