Base | Representation |
---|---|
bin | 10110111111010110100011… |
… | …00000011111000001101000 |
3 | 20122000001000101111100102122 |
4 | 23133223101200133001220 |
5 | 23111244203141342002 |
6 | 255304435223250412 |
7 | 13435332652655243 |
oct | 1337532140370150 |
9 | 218001011440378 |
10 | 50555280027752 |
11 | 15121412669635 |
12 | 5805b50ba9a08 |
13 | 222945b496536 |
14 | c6ac624b425a |
15 | 5ca0d39556a2 |
hex | 2dfad181f068 |
50555280027752 has 8 divisors (see below), whose sum is σ = 94791150052050. Its totient is φ = 25277640013872.
The previous prime is 50555280027709. The next prime is 50555280027851. The reversal of 50555280027752 is 25772008255505.
50555280027752 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 48742934044996 + 1812345982756 = 6981614^2 + 1346234^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a junction number, because it is equal to n+sod(n) for n = 50555280027694 and 50555280027703.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 3159705001727 + ... + 3159705001742.
Almost surely, 250555280027752 is an apocalyptic number.
It is an amenable number.
50555280027752 is a deficient number, since it is larger than the sum of its proper divisors (44235870024298).
50555280027752 is a wasteful number, since it uses less digits than its factorization.
50555280027752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6319410003475 (or 6319410003471 counting only the distinct ones).
The product of its (nonzero) digits is 9800000, while the sum is 53.
The spelling of 50555280027752 in words is "fifty trillion, five hundred fifty-five billion, two hundred eighty million, twenty-seven thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •