Base | Representation |
---|---|
bin | 101111101000110010… |
… | …000001000110110101 |
3 | 11220000201212120201122 |
4 | 233220302001012311 |
5 | 1314223404103401 |
6 | 35255323233325 |
7 | 3460355250101 |
oct | 575062010665 |
9 | 156021776648 |
10 | 51150066101 |
11 | 1a768973802 |
12 | 9ab6078845 |
13 | 4a920ccc04 |
14 | 2693382901 |
15 | 14e581a21b |
hex | be8c811b5 |
51150066101 has 16 divisors (see below), whose sum is σ = 52042705200. Its totient is φ = 50263031808.
The previous prime is 51150066031. The next prime is 51150066109. The reversal of 51150066101 is 10166005115.
It can be written as a sum of positive squares in 8 ways, for example, as 877699876 + 50272366225 = 29626^2 + 224215^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51150066101 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51150066109) 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 in 15 ways as a sum of consecutive naturals, for example, 36301685 + ... + 36303093.
It is an arithmetic number, because the mean of its divisors is an integer number (3252669075).
Almost surely, 251150066101 is an apocalyptic number.
It is an amenable number.
51150066101 is a deficient number, since it is larger than the sum of its proper divisors (892639099).
51150066101 is a wasteful number, since it uses less digits than its factorization.
51150066101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2968.
The product of its (nonzero) digits is 900, while the sum is 26.
The spelling of 51150066101 in words is "fifty-one billion, one hundred fifty million, sixty-six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •