Base | Representation |
---|---|
bin | 10110111111011111011100… |
… | …01011110000010010010101 |
3 | 20122000111100020111221211222 |
4 | 23133233232023300102111 |
5 | 23111333443330144424 |
6 | 255310545155140125 |
7 | 13435562215630142 |
oct | 1337575613602225 |
9 | 218014306457758 |
10 | 50560056099989 |
11 | 15123443630377 |
12 | 5806a645a4645 |
13 | 2229a3cb10997 |
14 | c6b1969253c9 |
15 | 5ca2b2dc7e5e |
hex | 2dfbee2f0495 |
50560056099989 has 2 divisors, whose sum is σ = 50560056099990. Its totient is φ = 50560056099988.
The previous prime is 50560056099887. The next prime is 50560056100007. The reversal of 50560056099989 is 98999065006505.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 31090270498225 + 19469785601764 = 5575865^2 + 4412458^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50560056099989 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50560056099389) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25280028049994 + 25280028049995.
It is an arithmetic number, because the mean of its divisors is an integer number (25280028049995).
Almost surely, 250560056099989 is an apocalyptic number.
It is an amenable number.
50560056099989 is a deficient number, since it is larger than the sum of its proper divisors (1).
50560056099989 is an equidigital number, since it uses as much as digits as its factorization.
50560056099989 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 236196000, while the sum is 71.
The spelling of 50560056099989 in words is "fifty trillion, five hundred sixty billion, fifty-six million, ninety-nine thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •