Base | Representation |
---|---|
bin | 101110111000101000… |
… | …011011010000111001 |
3 | 11210221102211001002122 |
4 | 232320220123100321 |
5 | 1311100103323213 |
6 | 35043225011025 |
7 | 3431346011564 |
oct | 567050332071 |
9 | 153842731078 |
10 | 50342245433 |
11 | 1a393981117 |
12 | 990b623a75 |
13 | 499393c40c |
14 | 2617d7d4db |
15 | 149994ad08 |
hex | bb8a1b439 |
50342245433 has 2 divisors, whose sum is σ = 50342245434. Its totient is φ = 50342245432.
The previous prime is 50342245403. The next prime is 50342245439. The reversal of 50342245433 is 33454224305.
It is a happy number.
50342245433 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 40365631744 + 9976613689 = 200912^2 + 99883^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50342245433 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 50342245393 and 50342245402.
It is not a weakly prime, because it can be changed into another prime (50342245439) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25171122716 + 25171122717.
It is an arithmetic number, because the mean of its divisors is an integer number (25171122717).
Almost surely, 250342245433 is an apocalyptic number.
It is an amenable number.
50342245433 is a deficient number, since it is larger than the sum of its proper divisors (1).
50342245433 is an equidigital number, since it uses as much as digits as its factorization.
50342245433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 172800, while the sum is 35.
Adding to 50342245433 its reverse (33454224305), we get a palindrome (83796469738).
The spelling of 50342245433 in words is "fifty billion, three hundred forty-two million, two hundred forty-five thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •