Base | Representation |
---|---|
bin | 101110100110001101… |
… | …001100000110010101 |
3 | 11210010220010121121101 |
4 | 232212031030012111 |
5 | 1304431434144131 |
6 | 34552423150101 |
7 | 3420603315343 |
oct | 564615140625 |
9 | 153126117541 |
10 | 50033115541 |
11 | 1a245431272 |
12 | 9843ba5331 |
13 | 4944895b16 |
14 | 25c8cb0993 |
15 | 147c736c61 |
hex | ba634c195 |
50033115541 has 8 divisors (see below), whose sum is σ = 50077515320. Its totient is φ = 49988740032.
The previous prime is 50033115487. The next prime is 50033115557. The reversal of 50033115541 is 14551133005.
It can be written as a sum of positive squares in 4 ways, for example, as 5794406641 + 44238708900 = 76121^2 + 210330^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 50033115541 - 27 = 50033115413 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 (50033115641) 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, 7731055 + ... + 7737523.
It is an arithmetic number, because the mean of its divisors is an integer number (6259689415).
Almost surely, 250033115541 is an apocalyptic number.
It is an amenable number.
50033115541 is a deficient number, since it is larger than the sum of its proper divisors (44399779).
50033115541 is a wasteful number, since it uses less digits than its factorization.
50033115541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12135.
The product of its (nonzero) digits is 4500, while the sum is 28.
Adding to 50033115541 its reverse (14551133005), we get a palindrome (64584248546).
The spelling of 50033115541 in words is "fifty billion, thirty-three million, one hundred fifteen thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •