Base | Representation |
---|---|
bin | 10010100001010100110… |
… | …101110001111101011001 |
3 | 11111200011000000002210021 |
4 | 102201110311301331121 |
5 | 131323024312012100 |
6 | 2412404044150441 |
7 | 160644345662200 |
oct | 22412465617531 |
9 | 4450130002707 |
10 | 1272733704025 |
11 | 450843aa5493 |
12 | 1867b7b38421 |
13 | 930311b99b4 |
14 | 4585a228237 |
15 | 231902dca1a |
hex | 12854d71f59 |
1272733704025 has 27 divisors (see below), whose sum is σ = 1835910390141. Its totient is φ = 872704607040.
The previous prime is 1272733704013. The next prime is 1272733704043. The reversal of 1272733704025 is 5204073372721.
It is a happy number.
The square root of 1272733704025 is 1128155.
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 13248240201 + 1259485463824 = 115101^2 + 1122268^2 .
It is not a de Polignac number, because 1272733704025 - 25 = 1272733703993 is a prime.
It is a super-2 number, since 2×12727337040252 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 39469309 + ... + 39501541.
Almost surely, 21272733704025 is an apocalyptic number.
1272733704025 is the 1128155-th square number.
1272733704025 is the 564078-th centered octagonal number.
It is an amenable number.
1272733704025 is a deficient number, since it is larger than the sum of its proper divisors (563176686116).
1272733704025 is an frugal number, since it uses more digits than its factorization.
1272733704025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64490 (or 32245 counting only the distinct ones).
The product of its (nonzero) digits is 493920, while the sum is 43.
The spelling of 1272733704025 in words is "one trillion, two hundred seventy-two billion, seven hundred thirty-three million, seven hundred four thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •