Base | Representation |
---|---|
bin | 10110111000100101000111… |
… | …00011111111010011101001 |
3 | 20121011210101012010221022221 |
4 | 23130102203203333103221 |
5 | 23043441121211213424 |
6 | 255005512522514041 |
7 | 13412454316352515 |
oct | 1334224343772351 |
9 | 217153335127287 |
10 | 50322580960489 |
11 | 15041761055202 |
12 | 5788a2a665921 |
13 | 2210525864266 |
14 | c5d8a9719145 |
15 | 5c40149589e4 |
hex | 2dc4a38ff4e9 |
50322580960489 has 4 divisors (see below), whose sum is σ = 50337137683924. Its totient is φ = 50308024237056.
The previous prime is 50322580960469. The next prime is 50322580960579. The reversal of 50322580960489 is 98406908522305.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 16277456528089 + 34045124432400 = 4034533^2 + 5834820^2 .
It is a cyclic number.
It is not a de Polignac number, because 50322580960489 - 27 = 50322580960361 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50322580960469) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7278356532 + ... + 7278363445.
It is an arithmetic number, because the mean of its divisors is an integer number (12584284420981).
Almost surely, 250322580960489 is an apocalyptic number.
It is an amenable number.
50322580960489 is a deficient number, since it is larger than the sum of its proper divisors (14556723435).
50322580960489 is a wasteful number, since it uses less digits than its factorization.
50322580960489 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14556723434.
The product of its (nonzero) digits is 37324800, while the sum is 61.
The spelling of 50322580960489 in words is "fifty trillion, three hundred twenty-two billion, five hundred eighty million, nine hundred sixty thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •