Base | Representation |
---|---|
bin | 10110111001011111111001… |
… | …10101001001011000110001 |
3 | 20121021210211211110001212102 |
4 | 23130233330311021120301 |
5 | 23100000241202322041 |
6 | 255032212451310145 |
7 | 13414652420601161 |
oct | 1334577465113061 |
9 | 217253754401772 |
10 | 50354143401521 |
11 | 15054088247313 |
12 | 5792b788ab355 |
13 | 22134b584167b |
14 | c6122147c5a1 |
15 | 5c4c6081309b |
hex | 2dcbfcd49631 |
50354143401521 has 2 divisors, whose sum is σ = 50354143401522. Its totient is φ = 50354143401520.
The previous prime is 50354143401491. The next prime is 50354143401533. The reversal of 50354143401521 is 12510434145305.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 50215080787600 + 139062613921 = 7086260^2 + 372911^2 .
It is a cyclic number.
It is not a de Polignac number, because 50354143401521 - 210 = 50354143400497 is a prime.
It is a super-2 number, since 2×503541434015212 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (50354143401581) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25177071700760 + 25177071700761.
It is an arithmetic number, because the mean of its divisors is an integer number (25177071700761).
Almost surely, 250354143401521 is an apocalyptic number.
It is an amenable number.
50354143401521 is a deficient number, since it is larger than the sum of its proper divisors (1).
50354143401521 is an equidigital number, since it uses as much as digits as its factorization.
50354143401521 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144000, while the sum is 38.
Adding to 50354143401521 its reverse (12510434145305), we get a palindrome (62864577546826).
The spelling of 50354143401521 in words is "fifty trillion, three hundred fifty-four billion, one hundred forty-three million, four hundred one thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •