Base | Representation |
---|---|
bin | 101110101100111110… |
… | …111111000100100101 |
3 | 11210102211010001012011 |
4 | 232230332333010211 |
5 | 1310200042121202 |
6 | 35012004354221 |
7 | 3423454021234 |
oct | 565476770445 |
9 | 153384101164 |
10 | 50146832677 |
11 | 1a2a3641677 |
12 | 98760a5971 |
13 | 4962300076 |
14 | 25da032b1b |
15 | 14876eabd7 |
hex | bacfbf125 |
50146832677 has 4 divisors (see below), whose sum is σ = 52786139680. Its totient is φ = 47507525676.
The previous prime is 50146832651. The next prime is 50146832693. The reversal of 50146832677 is 77623864105.
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, and also an emirpimes, since its reverse is a distinct semiprime: 77623864105 = 5 ⋅15524772821.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50146832677 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 50146832677.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50146832627) 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, 1319653473 + ... + 1319653510.
It is an arithmetic number, because the mean of its divisors is an integer number (13196534920).
Almost surely, 250146832677 is an apocalyptic number.
It is an amenable number.
50146832677 is a deficient number, since it is larger than the sum of its proper divisors (2639307003).
50146832677 is a wasteful number, since it uses less digits than its factorization.
50146832677 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2639307002.
The product of its (nonzero) digits is 1693440, while the sum is 49.
The spelling of 50146832677 in words is "fifty billion, one hundred forty-six million, eight hundred thirty-two thousand, six hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •