Base | Representation |
---|---|
bin | 10000001111101… |
… | …010110000001101 |
3 | 200222211121100022 |
4 | 100033222300031 |
5 | 1024232331413 |
6 | 43013311525 |
7 | 6516401141 |
oct | 2017526015 |
9 | 628747308 |
10 | 272542733 |
11 | 12a930431 |
12 | 773355a5 |
13 | 446062b8 |
14 | 282a7221 |
15 | 18dd8608 |
hex | 103eac0d |
272542733 has 2 divisors, whose sum is σ = 272542734. Its totient is φ = 272542732.
The previous prime is 272542717. The next prime is 272542763. The reversal of 272542733 is 337245272.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 163507369 + 109035364 = 12787^2 + 10442^2 .
It is a cyclic number.
It is not a de Polignac number, because 272542733 - 24 = 272542717 is a prime.
It is a super-2 number, since 2×2725427332 = 148559082622218578, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 272542693 and 272542702.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (272542763) 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, 136271366 + 136271367.
It is an arithmetic number, because the mean of its divisors is an integer number (136271367).
Almost surely, 2272542733 is an apocalyptic number.
It is an amenable number.
272542733 is a deficient number, since it is larger than the sum of its proper divisors (1).
272542733 is an equidigital number, since it uses as much as digits as its factorization.
272542733 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 70560, while the sum is 35.
The square root of 272542733 is about 16508.8683137276. The cubic root of 272542733 is about 648.3530161608.
The spelling of 272542733 in words is "two hundred seventy-two million, five hundred forty-two thousand, seven hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •