Base | Representation |
---|---|
bin | 1111111011110110… |
… | …00000001100100001 |
3 | 211002012212121010101 |
4 | 13331323000030201 |
5 | 120010044221431 |
6 | 3532524502401 |
7 | 422000616514 |
oct | 77573001441 |
9 | 24065777111 |
10 | 8555070241 |
11 | 36a0128993 |
12 | 17a90aaa01 |
13 | a6453a353 |
14 | 5b22b6d7b |
15 | 3510e0961 |
hex | 1fdec0321 |
8555070241 has 2 divisors, whose sum is σ = 8555070242. Its totient is φ = 8555070240.
The previous prime is 8555070221. The next prime is 8555070257. The reversal of 8555070241 is 1420705558.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8520213025 + 34857216 = 92305^2 + 5904^2 .
It is a cyclic number.
It is not a de Polignac number, because 8555070241 - 29 = 8555069729 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 8555070241.
It is not a weakly prime, because it can be changed into another prime (8555070221) 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 as a sum of consecutive naturals, namely, 4277535120 + 4277535121.
It is an arithmetic number, because the mean of its divisors is an integer number (4277535121).
Almost surely, 28555070241 is an apocalyptic number.
It is an amenable number.
8555070241 is a deficient number, since it is larger than the sum of its proper divisors (1).
8555070241 is an equidigital number, since it uses as much as digits as its factorization.
8555070241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56000, while the sum is 37.
The square root of 8555070241 is about 92493.6227044870. The cubic root of 8555070241 is about 2045.2254732334.
Adding to 8555070241 its reverse (1420705558), we get a palindrome (9975775799).
The spelling of 8555070241 in words is "eight billion, five hundred fifty-five million, seventy thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •