Base | Representation |
---|---|
bin | 10110111111101100110100… |
… | …11111010110100011100101 |
3 | 20122001011220000211201000211 |
4 | 23133312122133112203211 |
5 | 23111443202410322200 |
6 | 255314134211335421 |
7 | 13436235252043312 |
oct | 1337663237264345 |
9 | 218034800751024 |
10 | 50567241885925 |
11 | 151264a0839736 |
12 | 580832abb1571 |
13 | 222a61676521b |
14 | c6b679003d09 |
15 | 5ca583b8eaba |
hex | 2dfd9a7d68e5 |
50567241885925 has 12 divisors (see below), whose sum is σ = 62710488632836. Its totient is φ = 40449207254400.
The previous prime is 50567241885859. The next prime is 50567241885961. The reversal of 50567241885925 is 52958814276505.
It can be written as a sum of positive squares in 6 ways, for example, as 82152744129 + 50485089141796 = 286623^2 + 7105286^2 .
It is not a de Polignac number, because 50567241885925 - 245 = 15382869797093 is a prime.
It is a hoax number, since the sum of its digits (67) coincides with the sum of the digits of its distinct prime factors.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 114431424 + ... + 114872473.
Almost surely, 250567241885925 is an apocalyptic number.
It is an amenable number.
50567241885925 is a deficient number, since it is larger than the sum of its proper divisors (12143246746911).
50567241885925 is a wasteful number, since it uses less digits than its factorization.
50567241885925 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 229312728 (or 229312723 counting only the distinct ones).
The product of its (nonzero) digits is 241920000, while the sum is 67.
The spelling of 50567241885925 in words is "fifty trillion, five hundred sixty-seven billion, two hundred forty-one million, eight hundred eighty-five thousand, nine hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •