Base | Representation |
---|---|
bin | 1100001011111001… |
… | …11010111111001000 |
3 | 121212221111122101202 |
4 | 12011330322333020 |
5 | 101344312313042 |
6 | 3001104203332 |
7 | 321060460064 |
oct | 60574727710 |
9 | 17787448352 |
10 | 6542307272 |
11 | 2857a64316 |
12 | 1327009548 |
13 | 803544947 |
14 | 460c58aa4 |
15 | 28455b632 |
hex | 185f3afc8 |
6542307272 has 12 divisors (see below), whose sum is σ = 12267255105. Its totient is φ = 3271039248.
The previous prime is 6542307271. The next prime is 6542307293. The reversal of 6542307272 is 2727032456.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 2 ways, for example, as 3733943236 + 2808364036 = 61106^2 + 52994^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=57194.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6542307271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 214478 + ... + 243074.
Almost surely, 26542307272 is an apocalyptic number.
It is an amenable number.
6542307272 is a deficient number, since it is larger than the sum of its proper divisors (5724947833).
6542307272 is an frugal number, since it uses more digits than its factorization.
6542307272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57200 (or 28599 counting only the distinct ones).
The product of its (nonzero) digits is 141120, while the sum is 38.
The square root of 6542307272 is about 80884.5304863668. The cubic root of 6542307272 is about 1870.2958602298.
The spelling of 6542307272 in words is "six billion, five hundred forty-two million, three hundred seven thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.395 sec. • engine limits •