Base | Representation |
---|---|
bin | 1110100011011010101… |
… | …11100101011100001111 |
3 | 1202210201102101010212201 |
4 | 13101231113211130033 |
5 | 31143101040334201 |
6 | 1021415330342331 |
7 | 51061506160204 |
oct | 7215527453417 |
9 | 1683642333781 |
10 | 500051105551 |
11 | 1830858a3898 |
12 | 80ab612a9a7 |
13 | 3820190244a |
14 | 1a2b9d27cab |
15 | d01a37a801 |
hex | 746d5e570f |
500051105551 has 2 divisors, whose sum is σ = 500051105552. Its totient is φ = 500051105550.
The previous prime is 500051105549. The next prime is 500051105557. The reversal of 500051105551 is 155501150005.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 500051105551 - 21 = 500051105549 is a prime.
It is a super-2 number, since 2×5000511055512 (a number of 24 digits) contains 22 as substring.
Together with 500051105549, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (500051105557) 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 as a sum of consecutive naturals, namely, 250025552775 + 250025552776.
It is an arithmetic number, because the mean of its divisors is an integer number (250025552776).
Almost surely, 2500051105551 is an apocalyptic number.
500051105551 is a deficient number, since it is larger than the sum of its proper divisors (1).
500051105551 is an equidigital number, since it uses as much as digits as its factorization.
500051105551 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3125, while the sum is 28.
Adding to 500051105551 its reverse (155501150005), we get a palindrome (655552255556).
The spelling of 500051105551 in words is "five hundred billion, fifty-one million, one hundred five thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.194 sec. • engine limits •