Base | Representation |
---|---|
bin | 10111001111011000011100… |
… | …01101110100111000100101 |
3 | 20200221200122210120102021212 |
4 | 23213230032031310320211 |
5 | 23144310144404014423 |
6 | 300405444112521205 |
7 | 13523201445362600 |
oct | 1347541615647045 |
9 | 220850583512255 |
10 | 51106054360613 |
11 | 15313a5739989a |
12 | 5894842250205 |
13 | 226938491b145 |
14 | c89790bd1337 |
15 | 5d95bbdd5578 |
hex | 2e7b0e374e25 |
51106054360613 has 24 divisors (see below), whose sum is σ = 61083286403832. Its totient is φ = 42602674391424.
The previous prime is 51106054360567. The next prime is 51106054360637. The reversal of 51106054360613 is 31606345060115.
It can be written as a sum of positive squares in 4 ways, for example, as 26887470907969 + 24218583452644 = 5185313^2 + 4921238^2 .
It is not a de Polignac number, because 51106054360613 - 212 = 51106054356517 is a prime.
It is a super-2 number, since 2×511060543606132 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51106054360643) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1989470 + ... + 10303887.
It is an arithmetic number, because the mean of its divisors is an integer number (2545136933493).
Almost surely, 251106054360613 is an apocalyptic number.
It is an amenable number.
51106054360613 is a deficient number, since it is larger than the sum of its proper divisors (9977232043219).
51106054360613 is a wasteful number, since it uses less digits than its factorization.
51106054360613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12295701 (or 12295694 counting only the distinct ones).
The product of its (nonzero) digits is 194400, while the sum is 41.
The spelling of 51106054360613 in words is "fifty-one trillion, one hundred six billion, fifty-four million, three hundred sixty thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •