Base | Representation |
---|---|
bin | 11001001010111000… |
… | …01101001111000101 |
3 | 1021212202012020001002 |
4 | 30211130031033011 |
5 | 210133320200000 |
6 | 10112515343045 |
7 | 655603025225 |
oct | 144534151705 |
9 | 37782166032 |
10 | 13513053125 |
11 | 5804847900 |
12 | 27515b1a85 |
13 | 1374777230 |
14 | 92295c085 |
15 | 5414e78d5 |
hex | 32570d3c5 |
13513053125 has 72 divisors (see below), whose sum is σ = 20000673000. Its totient is φ = 9068400000.
The previous prime is 13513053119. The next prime is 13513053139. The reversal of 13513053125 is 52135031531.
It is a happy number.
13513053125 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 12 ways, for example, as 11711135524 + 1801917601 = 108218^2 + 42449^2 .
It is not a de Polignac number, because 13513053125 - 232 = 9218085829 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 4914251 + ... + 4916999.
It is an arithmetic number, because the mean of its divisors is an integer number (277787125).
Almost surely, 213513053125 is an apocalyptic number.
It is an amenable number.
13513053125 is a deficient number, since it is larger than the sum of its proper divisors (6487619875).
13513053125 is an equidigital number, since it uses as much as digits as its factorization.
13513053125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2809 (or 2778 counting only the distinct ones).
The product of its (nonzero) digits is 6750, while the sum is 29.
Adding to 13513053125 its reverse (52135031531), we get a palindrome (65648084656).
The spelling of 13513053125 in words is "thirteen billion, five hundred thirteen million, fifty-three thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •