Base | Representation |
---|---|
bin | 1101010111000… |
… | …1100100001101 |
3 | 10220110010000012 |
4 | 3111301210031 |
5 | 103321232233 |
6 | 5321043005 |
7 | 1250221013 |
oct | 325614415 |
9 | 126403005 |
10 | 56039693 |
11 | 296a64a6 |
12 | 16926465 |
13 | b7c14a8 |
14 | 762a8b3 |
15 | 4dbe548 |
hex | 357190d |
56039693 has 2 divisors, whose sum is σ = 56039694. Its totient is φ = 56039692.
The previous prime is 56039681. The next prime is 56039699. The reversal of 56039693 is 39693065.
56039693 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 53260804 + 2778889 = 7298^2 + 1667^2 .
It is a cyclic number.
It is not a de Polignac number, because 56039693 - 28 = 56039437 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 56039693.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (56039699) 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 as a sum of consecutive naturals, namely, 28019846 + 28019847.
It is an arithmetic number, because the mean of its divisors is an integer number (28019847).
Almost surely, 256039693 is an apocalyptic number.
It is an amenable number.
56039693 is a deficient number, since it is larger than the sum of its proper divisors (1).
56039693 is an equidigital number, since it uses as much as digits as its factorization.
56039693 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 131220, while the sum is 41.
The square root of 56039693 is about 7485.9664038787. The cubic root of 56039693 is about 382.6766080362.
The spelling of 56039693 in words is "fifty-six million, thirty-nine thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •