Base | Representation |
---|---|
bin | 10000001001101… |
… | …011011011100001 |
3 | 200212212211120202 |
4 | 100021223123201 |
5 | 1023332111031 |
6 | 42515514545 |
7 | 6500141462 |
oct | 2011533341 |
9 | 625784522 |
10 | 270972641 |
11 | 129a58835 |
12 | 768b8a55 |
13 | 441a6754 |
14 | 27db8d69 |
15 | 18bc82cb |
hex | 1026b6e1 |
270972641 has 2 divisors, whose sum is σ = 270972642. Its totient is φ = 270972640.
The previous prime is 270972631. The next prime is 270972659. The reversal of 270972641 is 146279072.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 182142016 + 88830625 = 13496^2 + 9425^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-270972641 is a prime.
It is a Chen prime.
It is equal to p14761478 and since 270972641 and 14761478 have the same sum of digits, it is a Honaker prime.
It is a junction number, because it is equal to n+sod(n) for n = 270972595 and 270972604.
It is not a weakly prime, because it can be changed into another prime (270972631) 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, 135486320 + 135486321.
It is an arithmetic number, because the mean of its divisors is an integer number (135486321).
Almost surely, 2270972641 is an apocalyptic number.
It is an amenable number.
270972641 is a deficient number, since it is larger than the sum of its proper divisors (1).
270972641 is an equidigital number, since it uses as much as digits as its factorization.
270972641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42336, while the sum is 38.
The square root of 270972641 is about 16461.2466417340. The cubic root of 270972641 is about 647.1055848936.
The spelling of 270972641 in words is "two hundred seventy million, nine hundred seventy-two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •