Base | Representation |
---|---|
bin | 11101100101000… |
… | …10010110000101 |
3 | 122021220020212022 |
4 | 32302202112011 |
5 | 1002010111101 |
6 | 40342132525 |
7 | 6102026606 |
oct | 1662422605 |
9 | 567806768 |
10 | 248128901 |
11 | 118075a09 |
12 | 6b121145 |
13 | 3c538b47 |
14 | 24d4ddad |
15 | 16bb4a1b |
hex | eca2585 |
248128901 has 8 divisors (see below), whose sum is σ = 257607000. Its totient is φ = 238712320.
The previous prime is 248128891. The next prime is 248128913. The reversal of 248128901 is 109821842.
It can be written as a sum of positive squares in 4 ways, for example, as 18576100 + 229552801 = 4310^2 + 15151^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 248128901 - 218 = 247866757 is a prime.
It is a super-2 number, since 2×2481289012 = 123135903022935602, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (248128931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7076 + ... + 23373.
It is an arithmetic number, because the mean of its divisors is an integer number (32200875).
Almost surely, 2248128901 is an apocalyptic number.
It is an amenable number.
248128901 is a deficient number, since it is larger than the sum of its proper divisors (9478099).
248128901 is a wasteful number, since it uses less digits than its factorization.
248128901 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30759.
The product of its (nonzero) digits is 9216, while the sum is 35.
The square root of 248128901 is about 15752.1078272084. The cubic root of 248128901 is about 628.3849629978.
The spelling of 248128901 in words is "two hundred forty-eight million, one hundred twenty-eight thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •