Base | Representation |
---|---|
bin | 101111001000010101… |
… | …010000011111110101 |
3 | 11211121210110200112112 |
4 | 233020111100133311 |
5 | 1312120021443203 |
6 | 35125314500405 |
7 | 3441024656561 |
oct | 571025203765 |
9 | 154553420475 |
10 | 50605656053 |
11 | 1a509634447 |
12 | 9983894705 |
13 | 4a06398ba4 |
14 | 2640d4a6a1 |
15 | 14b2b2d6d8 |
hex | bc85507f5 |
50605656053 has 8 divisors (see below), whose sum is σ = 51256987200. Its totient is φ = 49956163488.
The previous prime is 50605656037. The next prime is 50605656071. The reversal of 50605656053 is 35065650605.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 50605656053 - 24 = 50605656037 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 50605656053.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50605656953) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 404201 + ... + 514382.
It is an arithmetic number, because the mean of its divisors is an integer number (6407123400).
Almost surely, 250605656053 is an apocalyptic number.
It is an amenable number.
50605656053 is a deficient number, since it is larger than the sum of its proper divisors (651331147).
50605656053 is an equidigital number, since it uses as much as digits as its factorization.
50605656053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 919291.
The product of its (nonzero) digits is 405000, while the sum is 41.
The spelling of 50605656053 in words is "fifty billion, six hundred five million, six hundred fifty-six thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •