Base | Representation |
---|---|
bin | 11000101001001110… |
… | …10011101110100001 |
3 | 1021011001222202210221 |
4 | 30110213103232201 |
5 | 204044033010000 |
6 | 10024512523041 |
7 | 645604344661 |
oct | 142447235641 |
9 | 37131882727 |
10 | 13230750625 |
11 | 567a460854 |
12 | 2692b50481 |
13 | 132b134831 |
14 | 8d72741a1 |
15 | 52683261a |
hex | 3149d3ba1 |
13230750625 has 45 divisors (see below), whose sum is σ = 17086250181. Its totient is φ = 10241826000.
The previous prime is 13230750601. The next prime is 13230750647. The reversal of 13230750625 is 52605703231.
The square root of 13230750625 is 115025.
It is a perfect power (a square), and thus also a powerful number.
13230750625 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 2 ways, for example, as 1037290849 + 12193459776 = 32207^2 + 110424^2 .
It is not a de Polignac number, because 13230750625 - 217 = 13230619553 is a prime.
It is a Duffinian 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 44 ways as a sum of consecutive naturals, for example, 123651822 + ... + 123651928.
Almost surely, 213230750625 is an apocalyptic number.
13230750625 is the 115025-th square number.
13230750625 is the 57513-rd centered octagonal number.
It is an amenable number.
13230750625 is a deficient number, since it is larger than the sum of its proper divisors (3855499556).
13230750625 is an frugal number, since it uses more digits than its factorization.
13230750625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 320 (or 155 counting only the distinct ones).
The product of its (nonzero) digits is 37800, while the sum is 34.
The spelling of 13230750625 in words is "thirteen billion, two hundred thirty million, seven hundred fifty thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •