Base | Representation |
---|---|
bin | 100010101101010010010101… |
… | …010010110011111110100001 |
3 | 202000110210002021110201011110 |
4 | 202231102111102303332201 |
5 | 130001421233430432023 |
6 | 1300352235015133533 |
7 | 44103166214340462 |
oct | 4255222522637641 |
9 | 660423067421143 |
10 | 152645642436513 |
11 | 44701720767756 |
12 | 151538b89742a9 |
13 | 6723564aa5065 |
14 | 299a134c50d69 |
15 | 129a9e42b9a93 |
hex | 8ad4954b3fa1 |
152645642436513 has 8 divisors (see below), whose sum is σ = 210092927224576. Its totient is φ = 98481059636400.
The previous prime is 152645642436403. The next prime is 152645642436541. The reversal of 152645642436513 is 315634246546251.
152645642436513 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-152645642436513 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (152645642436563) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 820675496878 + ... + 820675497063.
It is an arithmetic number, because the mean of its divisors is an integer number (26261615903072).
Almost surely, 2152645642436513 is an apocalyptic number.
It is an amenable number.
152645642436513 is a deficient number, since it is larger than the sum of its proper divisors (57447284788063).
152645642436513 is a wasteful number, since it uses less digits than its factorization.
152645642436513 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1641350993975.
The product of its digits is 62208000, while the sum is 57.
The spelling of 152645642436513 in words is "one hundred fifty-two trillion, six hundred forty-five billion, six hundred forty-two million, four hundred thirty-six thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •