Base | Representation |
---|---|
bin | 111110110000010101… |
… | …1110011010000000001 |
3 | 110212212002011020200021 |
4 | 1331200223303100001 |
5 | 4202000104043100 |
6 | 141524412453441 |
7 | 12510425534212 |
oct | 1754053632001 |
9 | 425762136607 |
10 | 134766081025 |
11 | 52176a37374 |
12 | 22150a7a281 |
13 | c929431414 |
14 | 6746479409 |
15 | 378b4b0a1a |
hex | 1f60af3401 |
134766081025 has 9 divisors (see below), whose sum is σ = 167112216553. Its totient is φ = 107811396400.
The previous prime is 134766081019. The next prime is 134766081029. The reversal of 134766081025 is 520180667431.
The square root of 134766081025 is 367105.
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 57646569409 + 77119511616 = 240097^2 + 277704^2 .
It is not a de Polignac number, because 134766081025 - 29 = 134766080513 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134766081029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 1798815 + ... + 1872235.
Almost surely, 2134766081025 is an apocalyptic number.
134766081025 is the 367105-th square number.
134766081025 is the 183553-rd centered octagonal number.
It is an amenable number.
134766081025 is a deficient number, since it is larger than the sum of its proper divisors (32346135528).
134766081025 is an frugal number, since it uses more digits than its factorization.
134766081025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146852 (or 73426 counting only the distinct ones).
The product of its (nonzero) digits is 241920, while the sum is 43.
The spelling of 134766081025 in words is "one hundred thirty-four billion, seven hundred sixty-six million, eighty-one thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •