Base | Representation |
---|---|
bin | 10110110010000110100101… |
… | …10100100110000111100001 |
3 | 20120101111221121200101221021 |
4 | 23121003102310212013201 |
5 | 23031314333044343041 |
6 | 254315345534125441 |
7 | 13360415404464055 |
oct | 1331032264460741 |
9 | 216344847611837 |
10 | 50100035543521 |
11 | 14a6633aa605a7 |
12 | 5751880650881 |
13 | 21c554a6c8992 |
14 | c52bd727bc65 |
15 | 5bd33c06acd1 |
hex | 2d90d2d261e1 |
50100035543521 has 2 divisors, whose sum is σ = 50100035543522. Its totient is φ = 50100035543520.
The previous prime is 50100035543471. The next prime is 50100035543549. The reversal of 50100035543521 is 12534553000105.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 49845520338496 + 254515205025 = 7060136^2 + 504495^2 .
It is a cyclic number.
It is not a de Polignac number, because 50100035543521 - 219 = 50100035019233 is a prime.
It is a super-2 number, since 2×501000355435212 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (50100035547521) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25050017771760 + 25050017771761.
It is an arithmetic number, because the mean of its divisors is an integer number (25050017771761).
Almost surely, 250100035543521 is an apocalyptic number.
It is an amenable number.
50100035543521 is a deficient number, since it is larger than the sum of its proper divisors (1).
50100035543521 is an equidigital number, since it uses as much as digits as its factorization.
50100035543521 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45000, while the sum is 34.
Adding to 50100035543521 its reverse (12534553000105), we get a palindrome (62634588543626).
The spelling of 50100035543521 in words is "fifty trillion, one hundred billion, thirty-five million, five hundred forty-three thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •