Base | Representation |
---|---|
bin | 10111011011001001001001… |
… | …10110101111010001011001 |
3 | 20202101022201200201021111201 |
4 | 23231210210312233101121 |
5 | 23222420302221010410 |
6 | 301315235154554201 |
7 | 13564325545153315 |
oct | 1355444466572131 |
9 | 222338650637451 |
10 | 51510161110105 |
11 | 1545a378096935 |
12 | 593b020898961 |
13 | 2298506015869 |
14 | ca1168574b45 |
15 | 5e4d6e0dd83a |
hex | 2ed924daf459 |
51510161110105 has 32 divisors (see below), whose sum is σ = 65520184773888. Its totient is φ = 38741489664000.
The previous prime is 51510161110081. The next prime is 51510161110141. The reversal of 51510161110105 is 50101116101515.
It is not a de Polignac number, because 51510161110105 - 25 = 51510161110073 is a prime.
It is a super-2 number, since 2×515101611101052 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 289908324 + ... + 290085946.
It is an arithmetic number, because the mean of its divisors is an integer number (2047505774184).
Almost surely, 251510161110105 is an apocalyptic number.
It is an amenable number.
51510161110105 is a deficient number, since it is larger than the sum of its proper divisors (14010023663783).
51510161110105 is a wasteful number, since it uses less digits than its factorization.
51510161110105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 181377.
The product of its (nonzero) digits is 750, while the sum is 28.
The spelling of 51510161110105 in words is "fifty-one trillion, five hundred ten billion, one hundred sixty-one million, one hundred ten thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •