Base | Representation |
---|---|
bin | 1101010111010… |
… | …0000010010111 |
3 | 10220110121220002 |
4 | 3111310002113 |
5 | 103322043230 |
6 | 5321201515 |
7 | 1250262353 |
oct | 325640227 |
9 | 126417802 |
10 | 56049815 |
11 | 29703068 |
12 | 1693029b |
13 | b7c5c93 |
14 | 7630463 |
15 | 4dc2545 |
hex | 3574097 |
56049815 has 4 divisors (see below), whose sum is σ = 67259784. Its totient is φ = 44839848.
The previous prime is 56049809. The next prime is 56049821. The reversal of 56049815 is 51894065.
56049815 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 51894065 = 5 ⋅10378813.
It is an interprime number because it is at equal distance from previous prime (56049809) and next prime (56049821).
It is a cyclic number.
It is not a de Polignac number, because 56049815 - 28 = 56049559 is a prime.
It is a Duffinian number.
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 3 ways as a sum of consecutive naturals, for example, 5604977 + ... + 5604986.
It is an arithmetic number, because the mean of its divisors is an integer number (16814946).
Almost surely, 256049815 is an apocalyptic number.
56049815 is a deficient number, since it is larger than the sum of its proper divisors (11209969).
56049815 is a wasteful number, since it uses less digits than its factorization.
56049815 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11209968.
The product of its (nonzero) digits is 43200, while the sum is 38.
The square root of 56049815 is about 7486.6424383698. The cubic root of 56049815 is about 382.6996465841.
The spelling of 56049815 in words is "fifty-six million, forty-nine thousand, eight hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •