Base | Representation |
---|---|
bin | 1101100011111… |
… | …0010100000101 |
3 | 10222000201102020 |
4 | 3120332110011 |
5 | 104030101331 |
6 | 5351033353 |
7 | 1260313032 |
oct | 330762405 |
9 | 128021366 |
10 | 56878341 |
11 | 2a1195a3 |
12 | 1706b859 |
13 | ba26130 |
14 | 77a8389 |
15 | 4ed7c96 |
hex | 363e505 |
56878341 has 16 divisors (see below), whose sum is σ = 82709760. Its totient is φ = 34557120.
The previous prime is 56878307. The next prime is 56878369. The reversal of 56878341 is 14387865.
56878341 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 56878341 - 211 = 56876293 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 56878293 and 56878302.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56878391) 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, 6150 + ... + 12311.
It is an arithmetic number, because the mean of its divisors is an integer number (5169360).
Almost surely, 256878341 is an apocalyptic number.
It is an amenable number.
56878341 is a deficient number, since it is larger than the sum of its proper divisors (25831419).
56878341 is a wasteful number, since it uses less digits than its factorization.
56878341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18556.
The product of its digits is 161280, while the sum is 42.
The square root of 56878341 is about 7541.7730673894. The cubic root of 56878341 is about 384.5761141207.
It can be divided in two parts, 5687 and 8341, that added together give a triangular number (14028 = T167).
The spelling of 56878341 in words is "fifty-six million, eight hundred seventy-eight thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •