Base | Representation |
---|---|
bin | 1011111101000010110000… |
… | …0101010101010001110000 |
3 | 1201112111020221002122210200 |
4 | 2333100230011111101300 |
5 | 3210320024404134021 |
6 | 43541544455555200 |
7 | 2524401130415046 |
oct | 277205405252160 |
9 | 51474227078720 |
10 | 13143339521136 |
11 | 4208071571560 |
12 | 158332598bb00 |
13 | 744547389306 |
14 | 3361d8d9a396 |
15 | 17bd4d666126 |
hex | bf42c155470 |
13143339521136 has 60 divisors (see below), whose sum is σ = 40127013845880. Its totient is φ = 3982830157440.
The previous prime is 13143339521023. The next prime is 13143339521209. The reversal of 13143339521136 is 63112593334131.
13143339521136 is a `hidden beast` number, since 1 + 3 + 1 + 43 + 3 + 395 + 211 + 3 + 6 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 13143339521091 and 13143339521100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4148779831 + ... + 4148782998.
It is an arithmetic number, because the mean of its divisors is an integer number (668783564098).
Almost surely, 213143339521136 is an apocalyptic number.
13143339521136 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
13143339521136 is an abundant number, since it is smaller than the sum of its proper divisors (26983674324744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13143339521136 is a wasteful number, since it uses less digits than its factorization.
13143339521136 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8297562854 (or 8297562845 counting only the distinct ones).
The product of its digits is 524880, while the sum is 45.
The spelling of 13143339521136 in words is "thirteen trillion, one hundred forty-three billion, three hundred thirty-nine million, five hundred twenty-one thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •