Base | Representation |
---|---|
bin | 101000001011001111… |
… | …1100101101011000001 |
3 | 22020200202212202121121 |
4 | 1100112133211223001 |
5 | 2403143320203231 |
6 | 103345053352241 |
7 | 6143006031454 |
oct | 1202637455301 |
9 | 266622782547 |
10 | 86276725441 |
11 | 33653a64885 |
12 | 14879a98681 |
13 | 819c63c93a |
14 | 426661d49b |
15 | 239e569311 |
hex | 14167e5ac1 |
86276725441 has 3 divisors (see below), whose sum is σ = 86277019171. Its totient is φ = 86276431712.
The previous prime is 86276725439. The next prime is 86276725463. The reversal of 86276725441 is 14452767268.
The square root of 86276725441 is 293729.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in only one way, i.e., 11594767041 + 74681958400 = 107679^2 + 273280^2 .
It is not a de Polignac number, because 86276725441 - 21 = 86276725439 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (86276725741) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 146865 + ... + 440593.
Almost surely, 286276725441 is an apocalyptic number.
86276725441 is the 293729-th square number.
86276725441 is the 146865-th centered octagonal number.
It is an amenable number.
86276725441 is a deficient number, since it is larger than the sum of its proper divisors (293730).
86276725441 is an frugal number, since it uses more digits than its factorization.
86276725441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 587458 (or 293729 counting only the distinct ones).
The product of its digits is 4515840, while the sum is 52.
The spelling of 86276725441 in words is "eighty-six billion, two hundred seventy-six million, seven hundred twenty-five thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •