Base | Representation |
---|---|
bin | 101111000011110111… |
… | …101011100100011111 |
3 | 11211102120121021202222 |
4 | 233003313223210133 |
5 | 1311441340400014 |
6 | 35114042135555 |
7 | 3436125442265 |
oct | 570367534437 |
9 | 154376537688 |
10 | 50530793759 |
11 | 1a480352286 |
12 | 99627b15bb |
13 | 49c3a17184 |
14 | 2635020435 |
15 | 14ab29208e |
hex | bc3deb91f |
50530793759 has 16 divisors (see below), whose sum is σ = 56550182400. Its totient is φ = 44925937056.
The previous prime is 50530793743. The next prime is 50530793767. The reversal of 50530793759 is 95739703505.
It is a cyclic number.
It is not a de Polignac number, because 50530793759 - 24 = 50530793743 is a prime.
It is a super-2 number, since 2×505307937592 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (53).
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 50530793759.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50530792759) 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 15 ways as a sum of consecutive naturals, for example, 1067699 + ... + 1114020.
It is an arithmetic number, because the mean of its divisors is an integer number (3534386400).
Almost surely, 250530793759 is an apocalyptic number.
50530793759 is a deficient number, since it is larger than the sum of its proper divisors (6019388641).
50530793759 is a wasteful number, since it uses less digits than its factorization.
50530793759 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2181814.
The product of its (nonzero) digits is 4465125, while the sum is 53.
The spelling of 50530793759 in words is "fifty billion, five hundred thirty million, seven hundred ninety-three thousand, seven hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •