Base | Representation |
---|---|
bin | 101110110111100110… |
… | …101111000101101101 |
3 | 11210220020102011021202 |
4 | 232313212233011231 |
5 | 1311031201301013 |
6 | 35041411535245 |
7 | 3431046440615 |
oct | 566746570555 |
9 | 153806364252 |
10 | 50325025133 |
11 | 1a38518a269 |
12 | 99058ba525 |
13 | 49901c02a6 |
14 | 2615979a45 |
15 | 1498198858 |
hex | bb79af16d |
50325025133 has 8 divisors (see below), whose sum is σ = 52600752000. Its totient is φ = 48056605168.
The previous prime is 50325025129. The next prime is 50325025159. The reversal of 50325025133 is 33152052305.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 50325025133 - 22 = 50325025129 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50325025096 and 50325025105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50325025123) 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 7 ways as a sum of consecutive naturals, for example, 1812638 + ... + 1840191.
It is an arithmetic number, because the mean of its divisors is an integer number (6575094000).
Almost surely, 250325025133 is an apocalyptic number.
It is an amenable number.
50325025133 is a deficient number, since it is larger than the sum of its proper divisors (2275726867).
50325025133 is a wasteful number, since it uses less digits than its factorization.
50325025133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3653451.
The product of its (nonzero) digits is 13500, while the sum is 29.
Adding to 50325025133 its reverse (33152052305), we get a palindrome (83477077438).
The spelling of 50325025133 in words is "fifty billion, three hundred twenty-five million, twenty-five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •