Base | Representation |
---|---|
bin | 1111110011001100… |
… | …11001100101010101 |
3 | 210220011102201020112 |
4 | 13321212121211111 |
5 | 114333013412331 |
6 | 3521414412405 |
7 | 420130400423 |
oct | 77146314525 |
9 | 23804381215 |
10 | 8482560341 |
11 | 3663203152 |
12 | 1788961105 |
13 | a52500298 |
14 | 5a6800113 |
15 | 349a6b32b |
hex | 1f9999955 |
8482560341 has 2 divisors, whose sum is σ = 8482560342. Its totient is φ = 8482560340.
The previous prime is 8482560323. The next prime is 8482560367. The reversal of 8482560341 is 1430652848.
8482560341 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8345553316 + 137007025 = 91354^2 + 11705^2 .
It is a cyclic number.
It is not a de Polignac number, because 8482560341 - 230 = 7408818517 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (8482560041) by changing a digit.
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 as a sum of consecutive naturals, namely, 4241280170 + 4241280171.
It is an arithmetic number, because the mean of its divisors is an integer number (4241280171).
Almost surely, 28482560341 is an apocalyptic number.
It is an amenable number.
8482560341 is a deficient number, since it is larger than the sum of its proper divisors (1).
8482560341 is an equidigital number, since it uses as much as digits as its factorization.
8482560341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 184320, while the sum is 41.
The square root of 8482560341 is about 92100.8161798798. The cubic root of 8482560341 is about 2039.4308566231.
The spelling of 8482560341 in words is "eight billion, four hundred eighty-two million, five hundred sixty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •