Base | Representation |
---|---|
bin | 10000001001100… |
… | …000111110111001 |
3 | 200212210122212212 |
4 | 100021200332321 |
5 | 1023324223344 |
6 | 42514544505 |
7 | 6466602641 |
oct | 2011407671 |
9 | 625718785 |
10 | 270929849 |
11 | 129a29673 |
12 | 76898135 |
13 | 44190128 |
14 | 27da7521 |
15 | 18bba79e |
hex | 10260fb9 |
270929849 has 2 divisors, whose sum is σ = 270929850. Its totient is φ = 270929848.
The previous prime is 270929821. The next prime is 270929851. The reversal of 270929849 is 948929072.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 208282624 + 62647225 = 14432^2 + 7915^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-270929849 is a prime.
It is a Sophie Germain prime.
Together with 270929851, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 270929797 and 270929806.
It is not a weakly prime, because it can be changed into another prime (270929819) 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 as a sum of consecutive naturals, namely, 135464924 + 135464925.
It is an arithmetic number, because the mean of its divisors is an integer number (135464925).
Almost surely, 2270929849 is an apocalyptic number.
It is an amenable number.
270929849 is a deficient number, since it is larger than the sum of its proper divisors (1).
270929849 is an equidigital number, since it uses as much as digits as its factorization.
270929849 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 653184, while the sum is 50.
The square root of 270929849 is about 16459.9468103636. The cubic root of 270929849 is about 647.0715194620.
The spelling of 270929849 in words is "two hundred seventy million, nine hundred twenty-nine thousand, eight hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •