Base | Representation |
---|---|
bin | 101000001100111001010… |
… | …1101101110000001010001 |
3 | 201120012122100102021212010 |
4 | 1100121302231232001101 |
5 | 1211011204121432012 |
6 | 15430133241053133 |
7 | 1110120623413635 |
oct | 120316255560121 |
9 | 21505570367763 |
10 | 5525252530257 |
11 | 1840279012779 |
12 | 7529b7a871a9 |
13 | 31104bb65825 |
14 | 1515d06cadc5 |
15 | 98ad02aac3c |
hex | 50672b6e051 |
5525252530257 has 16 divisors (see below), whose sum is σ = 7800579528192. Its totient is φ = 3466725999360.
The previous prime is 5525252530253. The next prime is 5525252530267. The reversal of 5525252530257 is 7520352525255.
5525252530257 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5525252530257 - 22 = 5525252530253 is a prime.
It is a super-2 number, since 2×55252525302572 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5525252530253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 273408 + ... + 3335454.
It is an arithmetic number, because the mean of its divisors is an integer number (487536220512).
Almost surely, 25525252530257 is an apocalyptic number.
It is an amenable number.
5525252530257 is a deficient number, since it is larger than the sum of its proper divisors (2275326997935).
5525252530257 is a wasteful number, since it uses less digits than its factorization.
5525252530257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3097448.
The product of its (nonzero) digits is 5250000, while the sum is 48.
The spelling of 5525252530257 in words is "five trillion, five hundred twenty-five billion, two hundred fifty-two million, five hundred thirty thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •