Base | Representation |
---|---|
bin | 10110111000101010000011… |
… | …01010101001001101100001 |
3 | 20121012001020001101011111201 |
4 | 23130111001222221031201 |
5 | 23044012034234130441 |
6 | 255011032040041201 |
7 | 13412610125540011 |
oct | 1334250152511541 |
9 | 217161201334451 |
10 | 50325233505121 |
11 | 150428a2379253 |
12 | 578944aa63201 |
13 | 22108592738b3 |
14 | c5da7bb17c41 |
15 | 5c411c767c31 |
hex | 2dc541aa9361 |
50325233505121 has 2 divisors, whose sum is σ = 50325233505122. Its totient is φ = 50325233505120.
The previous prime is 50325233505119. The next prime is 50325233505227. The reversal of 50325233505121 is 12150533252305.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 35880399500625 + 14444834004496 = 5990025^2 + 3800636^2 .
It is a cyclic number.
It is not a de Polignac number, because 50325233505121 - 21 = 50325233505119 is a prime.
Together with 50325233505119, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (50325233509121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25162616752560 + 25162616752561.
It is an arithmetic number, because the mean of its divisors is an integer number (25162616752561).
Almost surely, 250325233505121 is an apocalyptic number.
It is an amenable number.
50325233505121 is a deficient number, since it is larger than the sum of its proper divisors (1).
50325233505121 is an equidigital number, since it uses as much as digits as its factorization.
50325233505121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 135000, while the sum is 37.
Adding to 50325233505121 its reverse (12150533252305), we get a palindrome (62475766757426).
The spelling of 50325233505121 in words is "fifty trillion, three hundred twenty-five billion, two hundred thirty-three million, five hundred five thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •