Base | Representation |
---|---|
bin | 10101110000110100010100… |
… | …00011110110011001011001 |
3 | 20021110001212121001021020002 |
4 | 22320122022003312121121 |
5 | 22233041303010031311 |
6 | 245441044000542345 |
7 | 13036354104100226 |
oct | 1270321203663131 |
9 | 207401777037202 |
10 | 47856841877081 |
11 | 14280a77683726 |
12 | 544ab876219b5 |
13 | 2091b5b231143 |
14 | bb63d7d2294d |
15 | 57eceda8593b |
hex | 2b868a0f6659 |
47856841877081 has 2 divisors, whose sum is σ = 47856841877082. Its totient is φ = 47856841877080.
The previous prime is 47856841876993. The next prime is 47856841877083. The reversal of 47856841877081 is 18077814865874.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 47378924065225 + 477917811856 = 6883235^2 + 691316^2 .
It is a cyclic number.
It is not a de Polignac number, because 47856841877081 - 210 = 47856841876057 is a prime.
It is a super-2 number, since 2×478568418770812 (a number of 28 digits) contains 22 as substring.
Together with 47856841877083, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (47856841877083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 23928420938540 + 23928420938541.
It is an arithmetic number, because the mean of its divisors is an integer number (23928420938541).
Almost surely, 247856841877081 is an apocalyptic number.
It is an amenable number.
47856841877081 is a deficient number, since it is larger than the sum of its proper divisors (1).
47856841877081 is an equidigital number, since it uses as much as digits as its factorization.
47856841877081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 674365440, while the sum is 74.
The spelling of 47856841877081 in words is "forty-seven trillion, eight hundred fifty-six billion, eight hundred forty-one million, eight hundred seventy-seven thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •