Base | Representation |
---|---|
bin | 10110110000101110001011… |
… | …10010000001000101010001 |
3 | 20120012222102210212211212001 |
4 | 23120113011302001011101 |
5 | 23030030131430422343 |
6 | 254241500104234001 |
7 | 13354115253202123 |
oct | 1330270562010521 |
9 | 216188383784761 |
10 | 50052572123473 |
11 | 14a481a4106617 |
12 | 574463516b901 |
13 | 21c0c2532534a |
14 | c507b37a1213 |
15 | 5bbeb022a44d |
hex | 2d85c5c81151 |
50052572123473 has 2 divisors, whose sum is σ = 50052572123474. Its totient is φ = 50052572123472.
The previous prime is 50052572123459. The next prime is 50052572123507. The reversal of 50052572123473 is 37432127525005.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 47492882514064 + 2559689609409 = 6891508^2 + 1599903^2 .
It is a cyclic number.
It is not a de Polignac number, because 50052572123473 - 29 = 50052572122961 is a prime.
It is not a weakly prime, because it can be changed into another prime (50052572123423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25026286061736 + 25026286061737.
It is an arithmetic number, because the mean of its divisors is an integer number (25026286061737).
Almost surely, 250052572123473 is an apocalyptic number.
It is an amenable number.
50052572123473 is a deficient number, since it is larger than the sum of its proper divisors (1).
50052572123473 is an equidigital number, since it uses as much as digits as its factorization.
50052572123473 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1764000, while the sum is 46.
Adding to 50052572123473 its reverse (37432127525005), we get a palindrome (87484699648478).
The spelling of 50052572123473 in words is "fifty trillion, fifty-two billion, five hundred seventy-two million, one hundred twenty-three thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •