Base | Representation |
---|---|
bin | 1011111100110111110011… |
… | …1111110100101101011000 |
3 | 1201112012200012202101102221 |
4 | 2333031330333310231120 |
5 | 3210243020412023331 |
6 | 43540341204033424 |
7 | 2524235261430520 |
oct | 277157477645530 |
9 | 51465605671387 |
10 | 13140402064216 |
11 | 42068a4439709 |
12 | 1582846092874 |
13 | 74419993241b |
14 | 335ddabd4680 |
15 | 17bc2a828711 |
hex | bf37cff4b58 |
13140402064216 has 32 divisors (see below), whose sum is σ = 28158133646880. Its totient is φ = 5631575040000.
The previous prime is 13140402064193. The next prime is 13140402064241. The reversal of 13140402064216 is 61246020404131.
It is a super-3 number, since 3×131404020642163 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16601466 + ... + 17374966.
It is an arithmetic number, because the mean of its divisors is an integer number (879941676465).
Almost surely, 213140402064216 is an apocalyptic number.
It is an amenable number.
13140402064216 is an abundant number, since it is smaller than the sum of its proper divisors (15017731582664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13140402064216 is a wasteful number, since it uses less digits than its factorization.
13140402064216 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1076875 (or 1076871 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 34.
Adding to 13140402064216 its reverse (61246020404131), we get a palindrome (74386422468347).
The spelling of 13140402064216 in words is "thirteen trillion, one hundred forty billion, four hundred two million, sixty-four thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •