Base | Representation |
---|---|
bin | 10110111111111101010001… |
… | …00010100000001000110101 |
3 | 20122002000200002211201212101 |
4 | 23133332220202200020311 |
5 | 23112114241241332341 |
6 | 255322154043422101 |
7 | 13440000046543045 |
oct | 1337765042401065 |
9 | 218060602751771 |
10 | 50576067527221 |
11 | 1512a20a670665 |
12 | 5809b92824931 |
13 | 222b3c2068292 |
14 | c6bc751cd725 |
15 | 5ca8ed8c9831 |
hex | 2dffa88a0235 |
50576067527221 has 16 divisors (see below), whose sum is σ = 50960602344960. Its totient is φ = 50193024848640.
The previous prime is 50576067527177. The next prime is 50576067527231. The reversal of 50576067527221 is 12272576067505.
50576067527221 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 50576067527221 - 27 = 50576067527093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50576067527231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 914333661 + ... + 914388973.
It is an arithmetic number, because the mean of its divisors is an integer number (3185037646560).
Almost surely, 250576067527221 is an apocalyptic number.
It is an amenable number.
50576067527221 is a deficient number, since it is larger than the sum of its proper divisors (384534817739).
50576067527221 is a wasteful number, since it uses less digits than its factorization.
50576067527221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68676.
The product of its (nonzero) digits is 12348000, while the sum is 55.
The spelling of 50576067527221 in words is "fifty trillion, five hundred seventy-six billion, sixty-seven million, five hundred twenty-seven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •