Base | Representation |
---|---|
bin | 1100111001000… |
… | …0000011101001 |
3 | 10202201220120112 |
4 | 3032100003221 |
5 | 102320124213 |
6 | 5210504105 |
7 | 1224365000 |
oct | 316200351 |
9 | 122656515 |
10 | 54067433 |
11 | 28579732 |
12 | 16135035 |
13 | b280884 |
14 | 7275c37 |
15 | 4b2eea8 |
hex | 33900e9 |
54067433 has 16 divisors (see below), whose sum is σ = 63388800. Its totient is φ = 46096848.
The previous prime is 54067427. The next prime is 54067439. The reversal of 54067433 is 33476045.
It is an interprime number because it is at equal distance from previous prime (54067427) and next prime (54067439).
It is not a de Polignac number, because 54067433 - 220 = 53018857 is a prime.
It is a super-2 number, since 2×540674332 = 5846574622418978, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 54067433.
It is not an unprimeable number, because it can be changed into a prime (54067439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 96791 + ... + 97347.
It is an arithmetic number, because the mean of its divisors is an integer number (3961800).
Almost surely, 254067433 is an apocalyptic number.
It is an amenable number.
54067433 is a deficient number, since it is larger than the sum of its proper divisors (9321367).
54067433 is an equidigital number, since it uses as much as digits as its factorization.
54067433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 861 (or 847 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 32.
The square root of 54067433 is about 7353.0560313383. The cubic root of 54067433 is about 378.1335833309.
The spelling of 54067433 in words is "fifty-four million, sixty-seven thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •