Base | Representation |
---|---|
bin | 1101100000010… |
… | …0110111101010 |
3 | 10221120202122202 |
4 | 3120010313222 |
5 | 104000034200 |
6 | 5342020202 |
7 | 1255313042 |
oct | 330046752 |
9 | 127522582 |
10 | 56643050 |
11 | 29a78842 |
12 | 16b77662 |
13 | b972cc9 |
14 | 7746722 |
15 | 4e8d1d5 |
hex | 3604dea |
56643050 has 12 divisors (see below), whose sum is σ = 105356166. Its totient is φ = 22657200.
The previous prime is 56643023. The next prime is 56643113. The reversal of 56643050 is 5034665.
56643050 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 3 ways, for example, as 30459361 + 26183689 = 5519^2 + 5117^2 .
It is a super-2 number, since 2×566430502 = 6416870226605000, which contains 22 as substring.
It is a hoax number, since the sum of its digits (29) coincides with the sum of the digits of its distinct prime factors.
It is a Curzon 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 5 ways as a sum of consecutive naturals, for example, 566381 + ... + 566480.
Almost surely, 256643050 is an apocalyptic number.
56643050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
56643050 is a deficient number, since it is larger than the sum of its proper divisors (48713116).
56643050 is a wasteful number, since it uses less digits than its factorization.
56643050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1132873 (or 1132868 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 29.
The square root of 56643050 is about 7526.1577182517. The cubic root of 56643050 is about 384.0450838632.
The spelling of 56643050 in words is "fifty-six million, six hundred forty-three thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •