Base | Representation |
---|---|
bin | 101111010010011011… |
… | …100010100000111001 |
3 | 11212001121021001110122 |
4 | 233102123202200321 |
5 | 1312441404343443 |
6 | 35154210023025 |
7 | 3445153005155 |
oct | 572233424071 |
9 | 155047231418 |
10 | 50775074873 |
11 | 1a59622a2a6 |
12 | 9a10577a75 |
13 | 4a32506803 |
14 | 265964c065 |
15 | 14c2946968 |
hex | bd26e2839 |
50775074873 has 4 divisors (see below), whose sum is σ = 52982686848. Its totient is φ = 48567462900.
The previous prime is 50775074869. The next prime is 50775074899. The reversal of 50775074873 is 37847057705.
50775074873 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 50775074873 - 22 = 50775074869 is a prime.
It is a super-2 number, since 2×507750748732 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50775073873) 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, 1103805953 + ... + 1103805998.
It is an arithmetic number, because the mean of its divisors is an integer number (13245671712).
Almost surely, 250775074873 is an apocalyptic number.
It is an amenable number.
50775074873 is a deficient number, since it is larger than the sum of its proper divisors (2207611975).
50775074873 is a wasteful number, since it uses less digits than its factorization.
50775074873 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2207611974.
The product of its (nonzero) digits is 5762400, while the sum is 53.
The spelling of 50775074873 in words is "fifty billion, seven hundred seventy-five million, seventy-four thousand, eight hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •