Base | Representation |
---|---|
bin | 1101010110110… |
… | …1000100110010 |
3 | 10220102011202220 |
4 | 3111231010302 |
5 | 103320140143 |
6 | 5320421510 |
7 | 1250113254 |
oct | 325550462 |
9 | 126364686 |
10 | 56021298 |
11 | 296936a3 |
12 | 16917896 |
13 | b7b5cc8 |
14 | 7623cd4 |
15 | 4db8d83 |
hex | 356d132 |
56021298 has 8 divisors (see below), whose sum is σ = 112042608. Its totient is φ = 18673764.
The previous prime is 56021297. The next prime is 56021299. The reversal of 56021298 is 89212065.
56021298 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (56021297) and next prime (56021299).
It is a sphenic number, since it is the product of 3 distinct primes.
56021298 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (56021297) 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 3 ways as a sum of consecutive naturals, for example, 4668436 + ... + 4668447.
It is an arithmetic number, because the mean of its divisors is an integer number (14005326).
Almost surely, 256021298 is an apocalyptic number.
56021298 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56021298 is a wasteful number, since it uses less digits than its factorization.
56021298 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9336888.
The product of its (nonzero) digits is 8640, while the sum is 33.
The square root of 56021298 is about 7484.7376707537. The cubic root of 56021298 is about 382.6347323217.
The spelling of 56021298 in words is "fifty-six million, twenty-one thousand, two hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •