Base | Representation |
---|---|
bin | 10110111000101011011111… |
… | …00010100110000111001101 |
3 | 20121012010012200121000222101 |
4 | 23130111233202212013031 |
5 | 23044020123301202323 |
6 | 255011240252115101 |
7 | 13412635162434343 |
oct | 1334255742460715 |
9 | 217163180530871 |
10 | 50326003147213 |
11 | 150431578647a2 |
12 | 5789624765a91 |
13 | 221094c857911 |
14 | c5db1201d993 |
15 | 5c41650e4dad |
hex | 2dc56f8a61cd |
50326003147213 has 2 divisors, whose sum is σ = 50326003147214. Its totient is φ = 50326003147212.
The previous prime is 50326003147169. The next prime is 50326003147237. The reversal of 50326003147213 is 31274130062305.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 47640737559529 + 2685265587684 = 6902227^2 + 1638678^2 .
It is a cyclic number.
It is not a de Polignac number, because 50326003147213 - 217 = 50326003016141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50326003147243) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25163001573606 + 25163001573607.
It is an arithmetic number, because the mean of its divisors is an integer number (25163001573607).
Almost surely, 250326003147213 is an apocalyptic number.
It is an amenable number.
50326003147213 is a deficient number, since it is larger than the sum of its proper divisors (1).
50326003147213 is an equidigital number, since it uses as much as digits as its factorization.
50326003147213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90720, while the sum is 37.
The spelling of 50326003147213 in words is "fifty trillion, three hundred twenty-six billion, three million, one hundred forty-seven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •