Base | Representation |
---|---|
bin | 110000000011111010… |
… | …000101100001000111 |
3 | 11221012110020001122001 |
4 | 300003322011201013 |
5 | 1321141410304101 |
6 | 35412421450131 |
7 | 3504552450310 |
oct | 600372054107 |
9 | 157173201561 |
10 | 51605166151 |
11 | 1a981853150 |
12 | a002570947 |
13 | 4b35494096 |
14 | 26d79ab607 |
15 | 1520764901 |
hex | c03e85847 |
51605166151 has 16 divisors (see below), whose sum is σ = 64412022528. Its totient is φ = 40166121600.
The previous prime is 51605166143. The next prime is 51605166161. The reversal of 51605166151 is 15166150615.
It is not a de Polignac number, because 51605166151 - 23 = 51605166143 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 51605166151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51605166161) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 312525 + ... + 448198.
It is an arithmetic number, because the mean of its divisors is an integer number (4025751408).
Almost surely, 251605166151 is an apocalyptic number.
51605166151 is a deficient number, since it is larger than the sum of its proper divisors (12806856377).
51605166151 is a wasteful number, since it uses less digits than its factorization.
51605166151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 761622.
The product of its (nonzero) digits is 27000, while the sum is 37.
The spelling of 51605166151 in words is "fifty-one billion, six hundred five million, one hundred sixty-six thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •