Base | Representation |
---|---|
bin | 1101100000011… |
… | …1000100111101 |
3 | 10221121020001200 |
4 | 3120013010331 |
5 | 104000331333 |
6 | 5342130113 |
7 | 1255351311 |
oct | 330070475 |
9 | 127536050 |
10 | 56652093 |
11 | 29a84613 |
12 | 16b80939 |
13 | b977164 |
14 | 7749b41 |
15 | 4e90c13 |
hex | 360713d |
56652093 has 6 divisors (see below), whose sum is σ = 81830814. Its totient is φ = 37768056.
The previous prime is 56652073. The next prime is 56652131. The reversal of 56652093 is 39025665.
56652093 is a `hidden beast` number, since 566 + 5 + 2 + 0 + 93 = 666.
56652093 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 only one way, i.e., 56520324 + 131769 = 7518^2 + 363^2 .
It is not a de Polignac number, because 56652093 - 213 = 56643901 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56652073) 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 5 ways as a sum of consecutive naturals, for example, 3147330 + ... + 3147347.
It is an arithmetic number, because the mean of its divisors is an integer number (13638469).
Almost surely, 256652093 is an apocalyptic number.
It is an amenable number.
56652093 is a deficient number, since it is larger than the sum of its proper divisors (25178721).
56652093 is a wasteful number, since it uses less digits than its factorization.
56652093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6294683 (or 6294680 counting only the distinct ones).
The product of its (nonzero) digits is 48600, while the sum is 36.
The square root of 56652093 is about 7526.7584656345. The cubic root of 56652093 is about 384.0655202327.
The spelling of 56652093 in words is "fifty-six million, six hundred fifty-two thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •