Base | Representation |
---|---|
bin | 101111010100111111… |
… | …001110011000101111 |
3 | 11212011121000001210022 |
4 | 233110333032120233 |
5 | 1313033400442142 |
6 | 35202341432355 |
7 | 3446213510615 |
oct | 572477163057 |
9 | 155147001708 |
10 | 50817984047 |
11 | 1a608477626 |
12 | 9a22a0b6bb |
13 | 4a3b37b55c |
14 | 266121b6b5 |
15 | 14c65c06d2 |
hex | bd4fce62f |
50817984047 has 4 divisors (see below), whose sum is σ = 50848433880. Its totient is φ = 50787534216.
The previous prime is 50817984037. The next prime is 50817984097. The reversal of 50817984047 is 74048971805.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50817984047 is a prime.
It is a super-2 number, since 2×508179840472 (a number of 22 digits) contains 22 as substring.
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 50817984047.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50817984037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15222413 + ... + 15225750.
It is an arithmetic number, because the mean of its divisors is an integer number (12712108470).
Almost surely, 250817984047 is an apocalyptic number.
50817984047 is a deficient number, since it is larger than the sum of its proper divisors (30449833).
50817984047 is a wasteful number, since it uses less digits than its factorization.
50817984047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30449832.
The product of its (nonzero) digits is 2257920, while the sum is 53.
The spelling of 50817984047 in words is "fifty billion, eight hundred seventeen million, nine hundred eighty-four thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •