Base | Representation |
---|---|
bin | 100000000001010100001111… |
… | …100011111001111010010001 |
3 | 200110122000112112110022012001 |
4 | 200001110033203321322101 |
5 | 121424311112044122100 |
6 | 1215303244134434001 |
7 | 41443324504663024 |
oct | 4001241743717221 |
9 | 613560475408161 |
10 | 140827943739025 |
11 | 40965882955734 |
12 | 13965495502901 |
13 | 6077030a3999a |
14 | 26ac1749591bb |
15 | 11433d0b2ed6a |
hex | 80150f8f9e91 |
140827943739025 has 27 divisors (see below), whose sum is σ = 174922853233233. Its totient is φ = 112471579572000.
The previous prime is 140827943739019. The next prime is 140827943739101. The reversal of 140827943739025 is 520937349728041.
The square root of 140827943739025 is 11867095.
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 27225259435089 + 113602684303936 = 5217783^2 + 10658456^2 .
It is a de Polignac number, because none of the positive numbers 2k-140827943739025 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, 42662204875 + ... + 42662208175.
Almost surely, 2140827943739025 is an apocalyptic number.
140827943739025 is the 11867095-th square number.
140827943739025 is the 5933548-th centered octagonal number.
It is an amenable number.
140827943739025 is a deficient number, since it is larger than the sum of its proper divisors (34094909494208).
140827943739025 is an frugal number, since it uses more digits than its factorization.
140827943739025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8050 (or 4025 counting only the distinct ones).
The product of its (nonzero) digits is 91445760, while the sum is 64.
The spelling of 140827943739025 in words is "one hundred forty trillion, eight hundred twenty-seven billion, nine hundred forty-three million, seven hundred thirty-nine thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •