Base | Representation |
---|---|
bin | 1011111000011101001001… |
… | …1100001001111001011000 |
3 | 1201020221211021211020002000 |
4 | 2332013102130021321120 |
5 | 3203022122143034224 |
6 | 43441432131441000 |
7 | 2515611064642434 |
oct | 276072234117130 |
9 | 51227737736060 |
10 | 13064526143064 |
11 | 41876a8464060 |
12 | 156bbab456160 |
13 | 739c97043666 |
14 | 33247da6b9c4 |
15 | 179c8943e0c9 |
hex | be1d2709e58 |
13064526143064 has 64 divisors (see below), whose sum is σ = 39589473168000. Its totient is φ = 3958947315360.
The previous prime is 13064526143051. The next prime is 13064526143131. The reversal of 13064526143064 is 46034162546031.
13064526143064 is a `hidden beast` number, since 1 + 3 + 0 + 64 + 526 + 1 + 4 + 3 + 0 + 64 = 666.
13064526143064 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2749266594 + ... + 2749271345.
It is an arithmetic number, because the mean of its divisors is an integer number (618585518250).
Almost surely, 213064526143064 is an apocalyptic number.
It is an amenable number.
13064526143064 is an abundant number, since it is smaller than the sum of its proper divisors (26524947024936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13064526143064 is a wasteful number, since it uses less digits than its factorization.
13064526143064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5498537965 (or 5498537955 counting only the distinct ones).
The product of its (nonzero) digits is 1244160, while the sum is 45.
Adding to 13064526143064 its reverse (46034162546031), we get a palindrome (59098688689095).
The spelling of 13064526143064 in words is "thirteen trillion, sixty-four billion, five hundred twenty-six million, one hundred forty-three thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •