Base | Representation |
---|---|
bin | 101110101101001111… |
… | …000110000011111001 |
3 | 11210110010001120222001 |
4 | 232231033012003321 |
5 | 1310202132234414 |
6 | 35012235101001 |
7 | 3423534640054 |
oct | 565517060371 |
9 | 153403046861 |
10 | 50151055609 |
11 | 1a2a5a663a6 |
12 | 98775a1761 |
13 | 496314b245 |
14 | 25da811a9b |
15 | 1487c82074 |
hex | bad3c60f9 |
50151055609 has 4 divisors (see below), whose sum is σ = 50159113060. Its totient is φ = 50142998160.
The previous prime is 50151055607. The next prime is 50151055621. The reversal of 50151055609 is 90655015105.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 90655015105 = 5 ⋅18131003021.
It can be written as a sum of positive squares in 2 ways, for example, as 18102895209 + 32048160400 = 134547^2 + 179020^2 .
It is a cyclic number.
It is not a de Polignac number, because 50151055609 - 21 = 50151055607 is a prime.
It is a super-3 number, since 3×501510556093 (a number of 33 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50151055601) 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, 4019382 + ... + 4031839.
It is an arithmetic number, because the mean of its divisors is an integer number (12539778265).
Almost surely, 250151055609 is an apocalyptic number.
It is an amenable number.
50151055609 is a deficient number, since it is larger than the sum of its proper divisors (8057451).
50151055609 is an equidigital number, since it uses as much as digits as its factorization.
50151055609 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8057450.
The product of its (nonzero) digits is 33750, while the sum is 37.
The spelling of 50151055609 in words is "fifty billion, one hundred fifty-one million, fifty-five thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •