Base | Representation |
---|---|
bin | 111011101100110101110010… |
… | …0110110111010101011110111 |
3 | 2112212100011021122200012112101 |
4 | 1313121223210312322223313 |
5 | 1022312231433104423020 |
6 | 5100510241524402531 |
7 | 215416362131012566 |
oct | 16731534466725367 |
9 | 2485304248605471 |
10 | 525132311014135 |
11 | 1423613a943a630 |
12 | 4aa921b0546447 |
13 | 197029c2643996 |
14 | 939677a423bdd |
15 | 40a9d6ab6400a |
hex | 1dd9ae4dbaaf7 |
525132311014135 has 32 divisors (see below), whose sum is σ = 687625972992000. Its totient is φ = 381814394578560.
The previous prime is 525132311014057. The next prime is 525132311014237. The reversal of 525132311014135 is 531410113231525.
It is not a de Polignac number, because 525132311014135 - 27 = 525132311014007 is a prime.
It is a super-2 number, since 2×5251323110141352 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 525132311014094 and 525132311014103.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8429194216 + ... + 8429256514.
It is an arithmetic number, because the mean of its divisors is an integer number (21488311656000).
Almost surely, 2525132311014135 is an apocalyptic number.
525132311014135 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
525132311014135 is a deficient number, since it is larger than the sum of its proper divisors (162493661977865).
525132311014135 is a wasteful number, since it uses less digits than its factorization.
525132311014135 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 99991.
The product of its (nonzero) digits is 54000, while the sum is 37.
The spelling of 525132311014135 in words is "five hundred twenty-five trillion, one hundred thirty-two billion, three hundred eleven million, fourteen thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •