Base | Representation |
---|---|
bin | 11000100111100101… |
… | …01010101110111001 |
3 | 1021010010000200121001 |
4 | 30103302222232321 |
5 | 204032014414400 |
6 | 10023301045001 |
7 | 645346142332 |
oct | 142362525671 |
9 | 37103020531 |
10 | 13216951225 |
11 | 5672696095 |
12 | 268a3b6761 |
13 | 13283127ca |
14 | 8d54c1289 |
15 | 525508a6a |
hex | 313caabb9 |
13216951225 has 9 divisors (see below), whose sum is σ = 16389732333. Its totient is φ = 10573101120.
The previous prime is 13216951199. The next prime is 13216951273. The reversal of 13216951225 is 52215961231.
The square root of 13216951225 is 114965.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 546297129 + 12670654096 = 23373^2 + 112564^2 .
It is a de Polignac number, because none of the positive numbers 2k-13216951225 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 (19) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 563329 + ... + 586321.
Almost surely, 213216951225 is an apocalyptic number.
13216951225 is the 114965-th square number.
13216951225 is the 57483-rd centered octagonal number.
It is an amenable number.
13216951225 is a deficient number, since it is larger than the sum of its proper divisors (3172781108).
13216951225 is an frugal number, since it uses more digits than its factorization.
13216951225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45996 (or 22998 counting only the distinct ones).
The product of its digits is 32400, while the sum is 37.
Multiplying 13216951225 by its product of digits (32400), we get a square (428229219690000 = 206937002).
The spelling of 13216951225 in words is "thirteen billion, two hundred sixteen million, nine hundred fifty-one thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •