Base | Representation |
---|---|
bin | 10111001101110000001000… |
… | …01000011101000000110011 |
3 | 20200202100002210121212101222 |
4 | 23212320010020131000303 |
5 | 23142401000423330412 |
6 | 300324023002015255 |
7 | 13516146562330511 |
oct | 1346700410350063 |
9 | 220670083555358 |
10 | 51050050605107 |
11 | 152a2228770434 |
12 | 5885a127a752b |
13 | 2263ccb099188 |
14 | c86b9ad954b1 |
15 | 5d7de0415072 |
hex | 2e6e0421d033 |
51050050605107 has 2 divisors, whose sum is σ = 51050050605108. Its totient is φ = 51050050605106.
The previous prime is 51050050605077. The next prime is 51050050605121. The reversal of 51050050605107 is 70150605005015.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 51050050605107 - 210 = 51050050604083 is a prime.
It is a super-2 number, since 2×510500506051072 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (51050050605157) 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 as a sum of consecutive naturals, namely, 25525025302553 + 25525025302554.
It is an arithmetic number, because the mean of its divisors is an integer number (25525025302554).
Almost surely, 251050050605107 is an apocalyptic number.
51050050605107 is a deficient number, since it is larger than the sum of its proper divisors (1).
51050050605107 is an equidigital number, since it uses as much as digits as its factorization.
51050050605107 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 26250, while the sum is 35.
The spelling of 51050050605107 in words is "fifty-one trillion, fifty billion, fifty million, six hundred five thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •