Base | Representation |
---|---|
bin | 100101011111001010010… |
… | …1111000011101000100111 |
3 | 200020112121222011111211220 |
4 | 1022332110233003220213 |
5 | 1133403111223322102 |
6 | 14542511542031423 |
7 | 1041142233131535 |
oct | 112762457035047 |
9 | 20215558144756 |
10 | 5152161151527 |
11 | 1707023720855 |
12 | 6b2634418573 |
13 | 2b4b012c26c0 |
14 | 13b51a181155 |
15 | 8e045de71bc |
hex | 4af94bc3a27 |
5152161151527 has 48 divisors (see below), whose sum is σ = 8112573574560. Its totient is φ = 2881158303744.
The previous prime is 5152161151523. The next prime is 5152161151541. The reversal of 5152161151527 is 7251511612515.
It is not a de Polignac number, because 5152161151527 - 22 = 5152161151523 is a prime.
It is a super-3 number, since 3×51521611515273 (a number of 39 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5152161151523) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4062502 + ... + 5177667.
It is an arithmetic number, because the mean of its divisors is an integer number (169011949470).
Almost surely, 25152161151527 is an apocalyptic number.
5152161151527 is a deficient number, since it is larger than the sum of its proper divisors (2960412423033).
5152161151527 is a wasteful number, since it uses less digits than its factorization.
5152161151527 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9240260 (or 9240231 counting only the distinct ones).
The product of its digits is 105000, while the sum is 42.
The spelling of 5152161151527 in words is "five trillion, one hundred fifty-two billion, one hundred sixty-one million, one hundred fifty-one thousand, five hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •