Base | Representation |
---|---|
bin | 11000001111000000… |
… | …10110110000100001 |
3 | 1020120202011100111201 |
4 | 30013200112300201 |
5 | 203121232333400 |
6 | 5551015041201 |
7 | 640264116100 |
oct | 140740266041 |
9 | 36522140451 |
10 | 13010824225 |
11 | 55772a88a3 |
12 | 2631370201 |
13 | 12c46c1779 |
14 | 8b5d86037 |
15 | 51238e06a |
hex | 307816c21 |
13010824225 has 27 divisors (see below), whose sum is σ = 18773210547. Its totient is φ = 8918970480.
The previous prime is 13010824223. The next prime is 13010824243. The reversal of 13010824225 is 52242801031.
The square root of 13010824225 is 114065.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 4683896721 + 8326927504 = 68439^2 + 91252^2 .
It is not a de Polignac number, because 13010824225 - 21 = 13010824223 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13010824193 and 13010824202.
It is not an unprimeable number, because it can be changed into a prime (13010824223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 3990646 + ... + 3993904.
Almost surely, 213010824225 is an apocalyptic number.
13010824225 is the 114065-th square number.
13010824225 is the 57033-rd centered octagonal number.
It is an amenable number.
13010824225 is a deficient number, since it is larger than the sum of its proper divisors (5762386322).
13010824225 is an frugal number, since it uses more digits than its factorization.
13010824225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6542 (or 3271 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 28.
The spelling of 13010824225 in words is "thirteen billion, ten million, eight hundred twenty-four thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •