Base | Representation |
---|---|
bin | 1110101100101111011… |
… | …01110101110010100111 |
3 | 1210021122021000001220012 |
4 | 13112113231311302213 |
5 | 31233323434100210 |
6 | 1024004134400435 |
7 | 51326525561651 |
oct | 7262755656247 |
9 | 1707567001805 |
10 | 505056550055 |
11 | 18521428a392 |
12 | 81a7250011b |
13 | 3881b919225 |
14 | 1a632a056d1 |
15 | d20ea0a305 |
hex | 7597b75ca7 |
505056550055 has 4 divisors (see below), whose sum is σ = 606067860072. Its totient is φ = 404045240040.
The previous prime is 505056550039. The next prime is 505056550067. The reversal of 505056550055 is 550055650505.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 505056550055 - 24 = 505056550039 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 505056549994 and 505056550021.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 50505655001 + ... + 50505655010.
It is an arithmetic number, because the mean of its divisors is an integer number (151516965018).
Almost surely, 2505056550055 is an apocalyptic number.
505056550055 is a deficient number, since it is larger than the sum of its proper divisors (101011310017).
505056550055 is a wasteful number, since it uses less digits than its factorization.
505056550055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101011310016.
The product of its (nonzero) digits is 468750, while the sum is 41.
The spelling of 505056550055 in words is "five hundred five billion, fifty-six million, five hundred fifty thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.351 sec. • engine limits •