Base | Representation |
---|---|
bin | 101110100100100011… |
… | …101000001000111101 |
3 | 11210001222001201012101 |
4 | 232210203220020331 |
5 | 1304402343140013 |
6 | 34545554105101 |
7 | 3420116152642 |
oct | 564443501075 |
9 | 153058051171 |
10 | 50005443133 |
11 | 1a230850608 |
12 | 983687b191 |
13 | 493bc27409 |
14 | 25c5349dc9 |
15 | 147a0bc8dd |
hex | ba48e823d |
50005443133 has 8 divisors (see below), whose sum is σ = 50144061240. Its totient is φ = 49866877440.
The previous prime is 50005443109. The next prime is 50005443181. The reversal of 50005443133 is 33134450005.
It can be written as a sum of positive squares in 4 ways, for example, as 302307769 + 49703135364 = 17387^2 + 222942^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50005443133 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50005446133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2611153 + ... + 2630233.
It is an arithmetic number, because the mean of its divisors is an integer number (6268007655).
Almost surely, 250005443133 is an apocalyptic number.
It is an amenable number.
50005443133 is a deficient number, since it is larger than the sum of its proper divisors (138618107).
50005443133 is a wasteful number, since it uses less digits than its factorization.
50005443133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26207.
The product of its (nonzero) digits is 10800, while the sum is 28.
Adding to 50005443133 its reverse (33134450005), we get a palindrome (83139893138).
The spelling of 50005443133 in words is "fifty billion, five million, four hundred forty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •