Base | Representation |
---|---|
bin | 10110111111010110000100… |
… | …11111010001101100100111 |
3 | 20122000000100211100200202002 |
4 | 23133223002133101230213 |
5 | 23111243144140142100 |
6 | 255304354222435515 |
7 | 13435323503136311 |
oct | 1337530237215447 |
9 | 218000324320662 |
10 | 50555028052775 |
11 | 151212a3407054 |
12 | 5805aa0732b9b |
13 | 222941b211c0c |
14 | c6ac3ac427b1 |
15 | 5ca0bb7812d5 |
hex | 2dfac27d1b27 |
50555028052775 has 24 divisors (see below), whose sum is σ = 66380772720240. Its totient is φ = 38062097948160.
The previous prime is 50555028052703. The next prime is 50555028052777. The reversal of 50555028052775 is 57725082055505.
It is a happy number.
It is not a de Polignac number, because 50555028052775 - 214 = 50555028036391 is a prime.
It is a super-2 number, since 2×505550280527752 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 50555028052775.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50555028052777) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1187432 + ... + 10125218.
It is an arithmetic number, because the mean of its divisors is an integer number (2765865530010).
Almost surely, 250555028052775 is an apocalyptic number.
50555028052775 is a deficient number, since it is larger than the sum of its proper divisors (15825744667465).
50555028052775 is a wasteful number, since it uses less digits than its factorization.
50555028052775 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8951123 (or 8951118 counting only the distinct ones).
The product of its (nonzero) digits is 24500000, while the sum is 56.
The spelling of 50555028052775 in words is "fifty trillion, five hundred fifty-five billion, twenty-eight million, fifty-two thousand, seven hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •