Base | Representation |
---|---|
bin | 1101000000111… |
… | …0101011010101 |
3 | 10210201021000021 |
4 | 3100032223111 |
5 | 102433223234 |
6 | 5225545141 |
7 | 1231655026 |
oct | 320165325 |
9 | 123637007 |
10 | 54586069 |
11 | 288a335a |
12 | 163451b1 |
13 | b402965 |
14 | 736cc4d |
15 | 4bd39b4 |
hex | 340ead5 |
54586069 has 8 divisors (see below), whose sum is σ = 57528000. Its totient is φ = 51651072.
The previous prime is 54586067. The next prime is 54586073. The reversal of 54586069 is 96068545.
54586069 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 54586069 - 21 = 54586067 is a prime.
It is a super-2 number, since 2×545860692 = 5959277857745522, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (54586067) 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 7 ways as a sum of consecutive naturals, for example, 25752 + ... + 27790.
It is an arithmetic number, because the mean of its divisors is an integer number (7191000).
Almost surely, 254586069 is an apocalyptic number.
It is an amenable number.
54586069 is a deficient number, since it is larger than the sum of its proper divisors (2941931).
54586069 is a wasteful number, since it uses less digits than its factorization.
54586069 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3467.
The product of its (nonzero) digits is 259200, while the sum is 43.
The square root of 54586069 is about 7388.2385586823. The cubic root of 54586069 is about 379.3388063417.
The spelling of 54586069 in words is "fifty-four million, five hundred eighty-six thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •