Base | Representation |
---|---|
bin | 1100110100100… |
… | …1101001100101 |
3 | 10202012020222111 |
4 | 3031021221211 |
5 | 102231412140 |
6 | 5200401021 |
7 | 1222054135 |
oct | 315115145 |
9 | 122166874 |
10 | 53779045 |
11 | 283a1aa1 |
12 | 16016171 |
13 | b1ac528 |
14 | 71dcac5 |
15 | 4ac47ea |
hex | 3349a65 |
53779045 has 8 divisors (see below), whose sum is σ = 65908224. Its totient is φ = 42107664.
The previous prime is 53778997. The next prime is 53779067. The reversal of 53779045 is 54097735.
53779045 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 53779045 - 27 = 53778917 is a prime.
It is a super-2 number, since 2×537790452 = 5784371362224050, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 53778989 and 53779007.
It is a congruent number.
It is an unprimeable number.
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, 114189 + ... + 114658.
It is an arithmetic number, because the mean of its divisors is an integer number (8238528).
Almost surely, 253779045 is an apocalyptic number.
It is an amenable number.
53779045 is a deficient number, since it is larger than the sum of its proper divisors (12129179).
53779045 is a wasteful number, since it uses less digits than its factorization.
53779045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228899.
The product of its (nonzero) digits is 132300, while the sum is 40.
The square root of 53779045 is about 7333.4197343395. The cubic root of 53779045 is about 377.4600808628.
The spelling of 53779045 in words is "fifty-three million, seven hundred seventy-nine thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •