Base | Representation |
---|---|
bin | 110100001100001011… |
… | …111100010010110101 |
3 | 12100122110022210010022 |
4 | 310030023330102311 |
5 | 1404231443010424 |
6 | 41424410534525 |
7 | 4022461625003 |
oct | 641413742265 |
9 | 170573283108 |
10 | 56039031989 |
11 | 21847633186 |
12 | aa3b437445 |
13 | 5390c53835 |
14 | 29d87bda73 |
15 | 16ceb3c95e |
hex | d0c2fc4b5 |
56039031989 has 2 divisors, whose sum is σ = 56039031990. Its totient is φ = 56039031988.
The previous prime is 56039031953. The next prime is 56039032043. The reversal of 56039031989 is 98913093065.
56039031989 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 28280139889 + 27758892100 = 168167^2 + 166610^2 .
It is a cyclic number.
It is not a de Polignac number, because 56039031989 - 224 = 56022254773 is a prime.
It is a super-2 number, since 2×560390319892 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 56039031989.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (56039030989) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28019515994 + 28019515995.
It is an arithmetic number, because the mean of its divisors is an integer number (28019515995).
Almost surely, 256039031989 is an apocalyptic number.
It is an amenable number.
56039031989 is a deficient number, since it is larger than the sum of its proper divisors (1).
56039031989 is an equidigital number, since it uses as much as digits as its factorization.
56039031989 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1574640, while the sum is 53.
The spelling of 56039031989 in words is "fifty-six billion, thirty-nine million, thirty-one thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •