Base | Representation |
---|---|
bin | 111000100101101100100000… |
… | …000100111000101101011001 |
3 | 1012122012210101101000200121002 |
4 | 320211230200010320231121 |
5 | 230110131301030144311 |
6 | 2241154205013554345 |
7 | 103265026251315515 |
oct | 7045544004705531 |
9 | 1178183341020532 |
10 | 248881008053081 |
11 | 7233492a805648 |
12 | 23ab69820459b5 |
13 | a8b44bc328781 |
14 | 4565c956c5145 |
15 | 1db8e75c5493b |
hex | e25b20138b59 |
248881008053081 has 2 divisors, whose sum is σ = 248881008053082. Its totient is φ = 248881008053080.
The previous prime is 248881008053071. The next prime is 248881008053113. The reversal of 248881008053081 is 180350800188842.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 231479762662681 + 17401245390400 = 15214459^2 + 4171480^2 .
It is a cyclic number.
It is not a de Polignac number, because 248881008053081 - 226 = 248880940944217 is a prime.
It is a super-2 number, since 2×2488810080530812 (a number of 30 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (248881008053011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 124440504026540 + 124440504026541.
It is an arithmetic number, because the mean of its divisors is an integer number (124440504026541).
Almost surely, 2248881008053081 is an apocalyptic number.
It is an amenable number.
248881008053081 is a deficient number, since it is larger than the sum of its proper divisors (1).
248881008053081 is an equidigital number, since it uses as much as digits as its factorization.
248881008053081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3932160, while the sum is 56.
The spelling of 248881008053081 in words is "two hundred forty-eight trillion, eight hundred eighty-one billion, eight million, fifty-three thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •