Base | Representation |
---|---|
bin | 1110101100101111010… |
… | …01110110001011001101 |
3 | 1210021122012000212200100 |
4 | 13112113221312023031 |
5 | 31233323202044203 |
6 | 1024004100121313 |
7 | 51326513641323 |
oct | 7262751661315 |
9 | 1707565025610 |
10 | 505055503053 |
11 | 1852137347a2 |
12 | 81a72096239 |
13 | 3881b6407ba |
14 | 1a632811d13 |
15 | d20e89eea3 |
hex | 7597a762cd |
505055503053 has 12 divisors (see below), whose sum is σ = 732216591808. Its totient is φ = 335461218120.
The previous prime is 505055503009. The next prime is 505055503061. The reversal of 505055503053 is 350305550505.
505055503053 is a `hidden beast` number, since 5 + 0 + 50 + 5 + 550 + 3 + 0 + 53 = 666.
It is not a de Polignac number, because 505055503053 - 29 = 505055502541 is a prime.
It is a super-2 number, since 2×5050555030532 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 505055502999 and 505055503017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (505055504053) 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 11 ways as a sum of consecutive naturals, for example, 103534975 + ... + 103539852.
Almost surely, 2505055503053 is an apocalyptic number.
It is an amenable number.
505055503053 is a deficient number, since it is larger than the sum of its proper divisors (227161088755).
505055503053 is a wasteful number, since it uses less digits than its factorization.
505055503053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 207075104 (or 207075101 counting only the distinct ones).
The product of its (nonzero) digits is 140625, while the sum is 36.
The spelling of 505055503053 in words is "five hundred five billion, fifty-five million, five hundred three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •