Base | Representation |
---|---|
bin | 100100100001111000000… |
… | …1000111100000101110111 |
3 | 122202221220210211200022000 |
4 | 1021003300020330011313 |
5 | 1124224041433124410 |
6 | 14402224212510343 |
7 | 1025502632430000 |
oct | 111036010740567 |
9 | 18687823750260 |
10 | 5020550676855 |
11 | 1666226a7621a |
12 | 69102431b3b3 |
13 | 2a558888849c |
14 | 134dd2c561a7 |
15 | 8a8e19b5dc0 |
hex | 490f023c177 |
5020550676855 has 240 divisors, whose sum is σ = 10661426580960. Its totient is φ = 2241466649856.
The previous prime is 5020550676803. The next prime is 5020550676859. The reversal of 5020550676855 is 5586760550205.
5020550676855 is a `hidden beast` number, since 5 + 0 + 2 + 0 + 550 + 6 + 7 + 6 + 85 + 5 = 666.
It is not a de Polignac number, because 5020550676855 - 29 = 5020550676343 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5020550676859) 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 in 239 ways as a sum of consecutive naturals, for example, 599321427 + ... + 599329803.
It is an arithmetic number, because the mean of its divisors is an integer number (44422610754).
Almost surely, 25020550676855 is an apocalyptic number.
5020550676855 is an abundant number, since it is smaller than the sum of its proper divisors (5640875904105).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5020550676855 is an frugal number, since it uses more digits than its factorization.
5020550676855 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8505 (or 8435 counting only the distinct ones).
The product of its (nonzero) digits is 12600000, while the sum is 54.
The spelling of 5020550676855 in words is "five trillion, twenty billion, five hundred fifty million, six hundred seventy-six thousand, eight hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •