Base | Representation |
---|---|
bin | 111110011110101000… |
… | …1101010100010010001 |
3 | 110211022200100011210021 |
4 | 1330331101222202101 |
5 | 4144241014331100 |
6 | 141345432103441 |
7 | 12456623261311 |
oct | 1747521524221 |
9 | 424280304707 |
10 | 134172027025 |
11 | 519a167a853 |
12 | 22005b34b81 |
13 | c86333808a |
14 | 66cb5dd441 |
15 | 3754269a1a |
hex | 1f3d46a891 |
134172027025 has 9 divisors (see below), whose sum is σ = 166375584571. Its totient is φ = 107336156440.
The previous prime is 134172027019. The next prime is 134172027053. The reversal of 134172027025 is 520720271431.
The square root of 134172027025 is 366295.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 48301929729 + 85870097296 = 219777^2 + 293036^2 .
It is not a de Polignac number, because 134172027025 - 219 = 134171502737 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 8 ways as a sum of consecutive naturals, for example, 1794846 + ... + 1868104.
Almost surely, 2134172027025 is an apocalyptic number.
134172027025 is the 366295-th square number.
134172027025 is the 183148-th centered octagonal number.
It is an amenable number.
134172027025 is a deficient number, since it is larger than the sum of its proper divisors (32203557546).
134172027025 is an frugal number, since it uses more digits than its factorization.
134172027025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146528 (or 73264 counting only the distinct ones).
The product of its (nonzero) digits is 23520, while the sum is 34.
Adding to 134172027025 its reverse (520720271431), we get a palindrome (654892298456).
The spelling of 134172027025 in words is "one hundred thirty-four billion, one hundred seventy-two million, twenty-seven thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •