Base | Representation |
---|---|
bin | 100000010101001… |
… | …000110111100101 |
3 | 1101210122101202000 |
4 | 200111020313211 |
5 | 2102324143021 |
6 | 125453435513 |
7 | 16304266566 |
oct | 4025106745 |
9 | 1353571660 |
10 | 542412261 |
11 | 2591a53a6 |
12 | 13179bb99 |
13 | 884b4901 |
14 | 5207616d |
15 | 32944b26 |
hex | 20548de5 |
542412261 has 16 divisors (see below), whose sum is σ = 803958720. Its totient is φ = 361434960.
The previous prime is 542412257. The next prime is 542412307. The reversal of 542412261 is 162214245.
542412261 is a `hidden beast` number, since 542 + 41 + 22 + 61 = 666.
It is not a de Polignac number, because 542412261 - 22 = 542412257 is a prime.
It is a super-2 number, since 2×5424122612 = 588422121766264242, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (542412961) 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 in 15 ways as a sum of consecutive naturals, for example, 79366 + ... + 85928.
It is an arithmetic number, because the mean of its divisors is an integer number (50247420).
Almost surely, 2542412261 is an apocalyptic number.
It is an amenable number.
542412261 is a deficient number, since it is larger than the sum of its proper divisors (261546459).
542412261 is a wasteful number, since it uses less digits than its factorization.
542412261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9633 (or 9627 counting only the distinct ones).
The product of its digits is 3840, while the sum is 27.
The square root of 542412261 is about 23289.7458337355. The cubic root of 542412261 is about 815.5360549328.
The spelling of 542412261 in words is "five hundred forty-two million, four hundred twelve thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •