Base | Representation |
---|---|
bin | 101111101001011101… |
… | …111000011111011111 |
3 | 11220001112111210110101 |
4 | 233221131320133133 |
5 | 1314234330041101 |
6 | 35300413521531 |
7 | 3460555062034 |
oct | 575135703737 |
9 | 156045453411 |
10 | 51161565151 |
11 | 1a774408154 |
12 | 9ab9aa32a7 |
13 | 4a945c7b98 |
14 | 2694ad738b |
15 | 14e683c401 |
hex | be97787df |
51161565151 has 4 divisors (see below), whose sum is σ = 51176927704. Its totient is φ = 51146202600.
The previous prime is 51161565131. The next prime is 51161565167. The reversal of 51161565151 is 15156516115.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 51161565151 - 231 = 49014081503 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 51161565151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51161565101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7676280 + ... + 7682941.
It is an arithmetic number, because the mean of its divisors is an integer number (12794231926).
Almost surely, 251161565151 is an apocalyptic number.
51161565151 is a deficient number, since it is larger than the sum of its proper divisors (15362553).
51161565151 is a wasteful number, since it uses less digits than its factorization.
51161565151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15362552.
The product of its digits is 22500, while the sum is 37.
The spelling of 51161565151 in words is "fifty-one billion, one hundred sixty-one million, five hundred sixty-five thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •