Base | Representation |
---|---|
bin | 11101100100000… |
… | …11101000001001 |
3 | 122021122212021022 |
4 | 32302003220021 |
5 | 1001442044311 |
6 | 40335322225 |
7 | 6100664024 |
oct | 1662035011 |
9 | 567585238 |
10 | 248003081 |
11 | 117a9a427 |
12 | 6b080375 |
13 | 3c4c37b1 |
14 | 24d1a1bb |
15 | 16b8c5db |
hex | ec83a09 |
248003081 has 2 divisors, whose sum is σ = 248003082. Its totient is φ = 248003080.
The previous prime is 248003057. The next prime is 248003083. The reversal of 248003081 is 180300842.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 246207481 + 1795600 = 15691^2 + 1340^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-248003081 is a prime.
It is a super-2 number, since 2×2480030812 = 123011056370985122, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 248003083, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 248003081.
It is not a weakly prime, because it can be changed into another prime (248003083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 124001540 + 124001541.
It is an arithmetic number, because the mean of its divisors is an integer number (124001541).
Almost surely, 2248003081 is an apocalyptic number.
It is an amenable number.
248003081 is a deficient number, since it is larger than the sum of its proper divisors (1).
248003081 is an equidigital number, since it uses as much as digits as its factorization.
248003081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1536, while the sum is 26.
The square root of 248003081 is about 15748.1135695676. The cubic root of 248003081 is about 628.2787322400.
The spelling of 248003081 in words is "two hundred forty-eight million, three thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •