Base | Representation |
---|---|
bin | 10111011111011000110100… |
… | …11111110011111111110011 |
3 | 20202220021012120211100122200 |
4 | 23233230122133303333303 |
5 | 23232313010122403201 |
6 | 301510240220034243 |
7 | 13611011144125332 |
oct | 1357543237637763 |
9 | 222807176740580 |
10 | 51656016216051 |
11 | 15506214536805 |
12 | 5963347392983 |
13 | 22a91ab941790 |
14 | ca8243655d19 |
15 | 5e8a58d76386 |
hex | 2efb1a7f3ff3 |
51656016216051 has 24 divisors (see below), whose sum is σ = 80356772037360. Its totient is φ = 31787143108416.
The previous prime is 51656016215981. The next prime is 51656016216127. The reversal of 51656016216051 is 15061261065615.
51656016216051 is a `hidden beast` number, since 5 + 1 + 6 + 5 + 6 + 0 + 16 + 21 + 605 + 1 = 666.
It is not a de Polignac number, because 51656016216051 - 223 = 51656007827443 is a prime.
It is a super-2 number, since 2×516560162160512 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 51656016215988 and 51656016216006.
It is not an unprimeable number, because it can be changed into a prime (51656016216251) 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, 4971381 + ... + 11314886.
It is an arithmetic number, because the mean of its divisors is an integer number (3348198834890).
Almost surely, 251656016216051 is an apocalyptic number.
51656016216051 is a deficient number, since it is larger than the sum of its proper divisors (28700755821309).
51656016216051 is a wasteful number, since it uses less digits than its factorization.
51656016216051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16313395 (or 16313392 counting only the distinct ones).
The product of its (nonzero) digits is 324000, while the sum is 45.
The spelling of 51656016216051 in words is "fifty-one trillion, six hundred fifty-six billion, sixteen million, two hundred sixteen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •