Base | Representation |
---|---|
bin | 101110111000111101… |
… | …010110011100000001 |
3 | 11210221211010201110021 |
4 | 232320331112130001 |
5 | 1311103004340224 |
6 | 35043542333441 |
7 | 3431443435564 |
oct | 567075263401 |
9 | 153854121407 |
10 | 50347730689 |
11 | 1a396a88293 |
12 | 991142a281 |
13 | 4994b10029 |
14 | 26189aa4db |
15 | 149a1811e4 |
hex | bb8f56701 |
50347730689 has 27 divisors (see below), whose sum is σ = 54570753993. Its totient is φ = 46441895808.
The previous prime is 50347730669. The next prime is 50347730701. The reversal of 50347730689 is 98603774305.
It is a happy number.
The square root of 50347730689 is 224383.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 32749055089 + 17598675600 = 180967^2 + 132660^2 .
It is a de Polignac number, because none of the positive numbers 2k-50347730689 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50347730669) 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 26 ways as a sum of consecutive naturals, for example, 255572139 + ... + 255572335.
Almost surely, 250347730689 is an apocalyptic number.
50347730689 is the 224383-rd square number.
50347730689 is the 112192-nd centered octagonal number.
It is an amenable number.
50347730689 is a deficient number, since it is larger than the sum of its proper divisors (4223023304).
50347730689 is an frugal number, since it uses more digits than its factorization.
50347730689 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 562 (or 281 counting only the distinct ones).
The product of its (nonzero) digits is 3810240, while the sum is 52.
The spelling of 50347730689 in words is "fifty billion, three hundred forty-seven million, seven hundred thirty thousand, six hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •