Base | Representation |
---|---|
bin | 10110111101110010000011… |
… | …00110100101111001001101 |
3 | 20121210212202020122221110201 |
4 | 23132321001212211321031 |
5 | 23104403203440231333 |
6 | 255223553335333501 |
7 | 13431412640113366 |
oct | 1336710146457115 |
9 | 217725666587421 |
10 | 50501326102093 |
11 | 15100546021729 |
12 | 57b75b3b21291 |
13 | 2224340517739 |
14 | c683c49c4b6d |
15 | 5c89c6ddc17d |
hex | 2dee419a5e4d |
50501326102093 has 2 divisors, whose sum is σ = 50501326102094. Its totient is φ = 50501326102092.
The previous prime is 50501326102061. The next prime is 50501326102103. The reversal of 50501326102093 is 39020162310505.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 48240206397289 + 2261119704804 = 6945517^2 + 1503702^2 .
It is a cyclic number.
It is not a de Polignac number, because 50501326102093 - 25 = 50501326102061 is a prime.
It is a super-2 number, since 2×505013261020932 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50501326102013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25250663051046 + 25250663051047.
It is an arithmetic number, because the mean of its divisors is an integer number (25250663051047).
Almost surely, 250501326102093 is an apocalyptic number.
It is an amenable number.
50501326102093 is a deficient number, since it is larger than the sum of its proper divisors (1).
50501326102093 is an equidigital number, since it uses as much as digits as its factorization.
50501326102093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48600, while the sum is 37.
Adding to 50501326102093 its reverse (39020162310505), we get a palindrome (89521488412598).
The spelling of 50501326102093 in words is "fifty trillion, five hundred one billion, three hundred twenty-six million, one hundred two thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •