Base | Representation |
---|---|
bin | 11111010011000010100111… |
… | …010100111111001100110001 |
3 | 200001101000100011020211221101 |
4 | 133103002213110333030301 |
5 | 121020210414303332100 |
6 | 1204430325304324401 |
7 | 40664506520250424 |
oct | 3723024724771461 |
9 | 601330304224841 |
10 | 137647919199025 |
11 | 3a94a177a06594 |
12 | 13531109773701 |
13 | 5ba61b2482841 |
14 | 25dc2a28b99bb |
15 | 10da81198686a |
hex | 7d30a753f331 |
137647919199025 has 27 divisors (see below), whose sum is σ = 173968554194659. Its totient is φ = 108038190590720.
The previous prime is 137647919198987. The next prime is 137647919199031. The reversal of 137647919199025 is 520991919746731.
The square root of 137647919199025 is 11732345.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 13 ways, for example, as 121482566179569 + 16165353019456 = 11021913^2 + 4020616^2 .
It is not a de Polignac number, because 137647919199025 - 215 = 137647919166257 is a prime.
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, 3109049289 + ... + 3109093561.
Almost surely, 2137647919199025 is an apocalyptic number.
137647919199025 is the 11732345-th square number.
137647919199025 is the 5866173-rd centered octagonal number.
It is an amenable number.
137647919199025 is a deficient number, since it is larger than the sum of its proper divisors (36320634995634).
137647919199025 is an frugal number, since it uses more digits than its factorization.
137647919199025 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 88662 (or 44331 counting only the distinct ones).
The product of its (nonzero) digits is 231472080, while the sum is 73.
The spelling of 137647919199025 in words is "one hundred thirty-seven trillion, six hundred forty-seven billion, nine hundred nineteen million, one hundred ninety-nine thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •