Base | Representation |
---|---|
bin | 10101111000001100010110… |
… | …01000000110111011100001 |
3 | 20022100021222221022002200211 |
4 | 22330012023020012323201 |
5 | 22301214304241403212 |
6 | 250153314415414121 |
7 | 13063565106540004 |
oct | 1274061310067341 |
9 | 208307887262624 |
10 | 48110262841057 |
11 | 143694a216182a |
12 | 5490111824341 |
13 | 20aca16c75c71 |
14 | bc4798bdb53b |
15 | 5866d1d989a7 |
hex | 2bc18b206ee1 |
48110262841057 has 2 divisors, whose sum is σ = 48110262841058. Its totient is φ = 48110262841056.
The previous prime is 48110262841051. The next prime is 48110262841129. The reversal of 48110262841057 is 75014826201184.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 48106486861456 + 3775979601 = 6935884^2 + 61449^2 .
It is a cyclic number.
It is not a de Polignac number, because 48110262841057 - 23 = 48110262841049 is a prime.
It is a super-2 number, since 2×481102628410572 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 48110262841057.
It is not a weakly prime, because it can be changed into another prime (48110262841051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24055131420528 + 24055131420529.
It is an arithmetic number, because the mean of its divisors is an integer number (24055131420529).
Almost surely, 248110262841057 is an apocalyptic number.
It is an amenable number.
48110262841057 is a deficient number, since it is larger than the sum of its proper divisors (1).
48110262841057 is an equidigital number, since it uses as much as digits as its factorization.
48110262841057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 860160, while the sum is 49.
The spelling of 48110262841057 in words is "forty-eight trillion, one hundred ten billion, two hundred sixty-two million, eight hundred forty-one thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •