Base | Representation |
---|---|
bin | 10111001111011000011100… |
… | …01101110100110111000011 |
3 | 20200221200122210120102011020 |
4 | 23213230032031310313003 |
5 | 23144310144404014030 |
6 | 300405444112520523 |
7 | 13523201445362400 |
oct | 1347541615646703 |
9 | 220850583512136 |
10 | 51106054360515 |
11 | 15313a57399810 |
12 | 5894842250143 |
13 | 226938491b09b |
14 | c89790bd12a7 |
15 | 5d95bbdd5510 |
hex | 2e7b0e374dc3 |
51106054360515 has 384 divisors, whose sum is σ = 113781810143232. Its totient is φ = 19289238958080.
The previous prime is 51106054360513. The next prime is 51106054360519. The reversal of 51106054360515 is 51506345060115.
It is not a de Polignac number, because 51106054360515 - 21 = 51106054360513 is a prime.
It is a super-2 number, since 2×511060543605152 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (51106054360513) by changing a digit.
It is a polite number, since it can be written in 383 ways as a sum of consecutive naturals, for example, 490489114 + ... + 490593296.
It is an arithmetic number, because the mean of its divisors is an integer number (296306797248).
Almost surely, 251106054360515 is an apocalyptic number.
51106054360515 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
51106054360515 is an abundant number, since it is smaller than the sum of its proper divisors (62675755782717).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51106054360515 is a wasteful number, since it uses less digits than its factorization.
51106054360515 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 104359 (or 104352 counting only the distinct ones).
The product of its (nonzero) digits is 270000, while the sum is 42.
The spelling of 51106054360515 in words is "fifty-one trillion, one hundred six billion, fifty-four million, three hundred sixty thousand, five hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •