Base | Representation |
---|---|
bin | 111100101000101010… |
… | …001010001111000011 |
3 | 20020001101122111200022 |
4 | 330220222022033003 |
5 | 2031314300300201 |
6 | 45524245244055 |
7 | 4463255252162 |
oct | 745052121703 |
9 | 206041574608 |
10 | 65106650051 |
11 | 25680008903 |
12 | 1075010362b |
13 | 61a771a401 |
14 | 3218b973d9 |
15 | 1a60c2441b |
hex | f28a8a3c3 |
65106650051 has 2 divisors, whose sum is σ = 65106650052. Its totient is φ = 65106650050.
The previous prime is 65106650039. The next prime is 65106650107. The reversal of 65106650051 is 15005660156.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 65106650051 - 26 = 65106649987 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 65106649993 and 65106650020.
It is not a weakly prime, because it can be changed into another prime (65106650351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 32553325025 + 32553325026.
It is an arithmetic number, because the mean of its divisors is an integer number (32553325026).
Almost surely, 265106650051 is an apocalyptic number.
65106650051 is a deficient number, since it is larger than the sum of its proper divisors (1).
65106650051 is an equidigital number, since it uses as much as digits as its factorization.
65106650051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27000, while the sum is 35.
The spelling of 65106650051 in words is "sixty-five billion, one hundred six million, six hundred fifty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •