Base | Representation |
---|---|
bin | 1110101100101111010… |
… | …00001000111010111111 |
3 | 1210021122011012010211012 |
4 | 13112113220020322333 |
5 | 31233323043234201 |
6 | 1024004042345435 |
7 | 51326510065544 |
oct | 7262750107277 |
9 | 1707564163735 |
10 | 505055055551 |
11 | 185213459562 |
12 | 81a71abb27b |
13 | 3881b514bc7 |
14 | 1a632736bcb |
15 | d20e8125bb |
hex | 7597a08ebf |
505055055551 has 8 divisors (see below), whose sum is σ = 538366483200. Its totient is φ = 472416586200.
The previous prime is 505055055539. The next prime is 505055055611. The reversal of 505055055551 is 155550550505.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-505055055551 is a prime.
It is a super-3 number, since 3×5050550555513 (a number of 36 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 505055055499 and 505055055508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (505055055451) 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 7 ways as a sum of consecutive naturals, for example, 168238025 + ... + 168241026.
It is an arithmetic number, because the mean of its divisors is an integer number (67295810400).
Almost surely, 2505055055551 is an apocalyptic number.
505055055551 is a deficient number, since it is larger than the sum of its proper divisors (33311427649).
505055055551 is a wasteful number, since it uses less digits than its factorization.
505055055551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 336479149.
The product of its (nonzero) digits is 390625, while the sum is 41.
The spelling of 505055055551 in words is "five hundred five billion, fifty-five million, fifty-five thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •