Base | Representation |
---|---|
bin | 10011010100011011000… |
… | …101110100110010010001 |
3 | 11200220202200111120000201 |
4 | 103110123011310302101 |
5 | 133222410421444400 |
6 | 2453520222415201 |
7 | 164626102521511 |
oct | 23243305646221 |
9 | 4626680446021 |
10 | 1327599406225 |
11 | 472039288624 |
12 | 19536a431501 |
13 | 98266026541 |
14 | 48382c5b841 |
15 | 24801e0c06a |
hex | 1351b174c91 |
1327599406225 has 27 divisors (see below), whose sum is σ = 1667897093457. Its totient is φ = 1048275989280.
The previous prime is 1327599406213. The next prime is 1327599406241. The reversal of 1327599406225 is 5226049957231.
The square root of 1327599406225 is 1152215.
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 431290352529 + 896309053696 = 656727^2 + 946736^2 .
It is not a de Polignac number, because 1327599406225 - 25 = 1327599406193 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 26 ways as a sum of consecutive naturals, for example, 455123467 + ... + 455126383.
Almost surely, 21327599406225 is an apocalyptic number.
1327599406225 is the 1152215-th square number.
1327599406225 is the 576108-th centered octagonal number.
It is an amenable number.
1327599406225 is a deficient number, since it is larger than the sum of its proper divisors (340297687232).
1327599406225 is an frugal number, since it uses more digits than its factorization.
1327599406225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6002 (or 3001 counting only the distinct ones).
The product of its (nonzero) digits is 8164800, while the sum is 55.
The spelling of 1327599406225 in words is "one trillion, three hundred twenty-seven billion, five hundred ninety-nine million, four hundred six thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •