Base | Representation |
---|---|
bin | 10000001001001… |
… | …101000011110001 |
3 | 200212122111221100 |
4 | 100021031003301 |
5 | 1023314120431 |
6 | 42513115013 |
7 | 6466113006 |
oct | 2011150361 |
9 | 625574840 |
10 | 270848241 |
11 | 129983324 |
12 | 76858a69 |
13 | 44161c41 |
14 | 27d858ad |
15 | 18ba14e6 |
hex | 1024d0f1 |
270848241 has 6 divisors (see below), whose sum is σ = 391225250. Its totient is φ = 180565488.
The previous prime is 270848239. The next prime is 270848243. The reversal of 270848241 is 142848072.
It is an interprime number because it is at equal distance from previous prime (270848239) and next prime (270848243).
It can be written as a sum of positive squares in only one way, i.e., 266832225 + 4016016 = 16335^2 + 2004^2 .
It is not a de Polignac number, because 270848241 - 21 = 270848239 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 270848196 and 270848205.
It is not an unprimeable number, because it can be changed into a prime (270848243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 15047116 + ... + 15047133.
Almost surely, 2270848241 is an apocalyptic number.
It is an amenable number.
270848241 is a deficient number, since it is larger than the sum of its proper divisors (120377009).
270848241 is a wasteful number, since it uses less digits than its factorization.
270848241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30094255 (or 30094252 counting only the distinct ones).
The product of its (nonzero) digits is 28672, while the sum is 36.
The square root of 270848241 is about 16457.4676363042. The cubic root of 270848241 is about 647.0065438288.
The spelling of 270848241 in words is "two hundred seventy million, eight hundred forty-eight thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •