Base | Representation |
---|---|
bin | 101000101110111011… |
… | …1001010100100110001 |
3 | 22100210012221002120222 |
4 | 1101131313022210301 |
5 | 2413121331310431 |
6 | 104103545142425 |
7 | 6214455324221 |
oct | 1213567124461 |
9 | 270705832528 |
10 | 87474088241 |
11 | 3410892a211 |
12 | 14b52a8aa15 |
13 | 833071c937 |
14 | 433b664081 |
15 | 241e73357b |
hex | 145ddca931 |
87474088241 has 2 divisors, whose sum is σ = 87474088242. Its totient is φ = 87474088240.
The previous prime is 87474088127. The next prime is 87474088243. The reversal of 87474088241 is 14288047478.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 68594229025 + 18879859216 = 261905^2 + 137404^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-87474088241 is a prime.
It is a super-2 number, since 2×874740882412 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 87474088243, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (87474088243) 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, 43737044120 + 43737044121.
It is an arithmetic number, because the mean of its divisors is an integer number (43737044121).
Almost surely, 287474088241 is an apocalyptic number.
It is an amenable number.
87474088241 is a deficient number, since it is larger than the sum of its proper divisors (1).
87474088241 is an equidigital number, since it uses as much as digits as its factorization.
87474088241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3211264, while the sum is 53.
The spelling of 87474088241 in words is "eighty-seven billion, four hundred seventy-four million, eighty-eight thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •