Base | Representation |
---|---|
bin | 10111010110100010000001… |
… | …00000100111001110001001 |
3 | 20201211011202001102000122210 |
4 | 23223101000200213032021 |
5 | 23212321301042011212 |
6 | 301114352301135333 |
7 | 13550016163640004 |
oct | 1353210040471611 |
9 | 221734661360583 |
10 | 51351711282057 |
11 | 153a915831191a |
12 | 591438025a549 |
13 | 22865a3c86964 |
14 | c976168a453b |
15 | 5e0b987ab53c |
hex | 2eb440827389 |
51351711282057 has 32 divisors (see below), whose sum is σ = 72528900716160. Its totient is φ = 32280213588480.
The previous prime is 51351711282041. The next prime is 51351711282127. The reversal of 51351711282057 is 75028211715315.
It is not a de Polignac number, because 51351711282057 - 24 = 51351711282041 is a prime.
It is a super-2 number, since 2×513517112820572 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 51351711281997 and 51351711282015.
It is not an unprimeable number, because it can be changed into a prime (51351711289057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 58348582 + ... + 59222127.
It is an arithmetic number, because the mean of its divisors is an integer number (2266528147380).
Almost surely, 251351711282057 is an apocalyptic number.
It is an amenable number.
51351711282057 is a deficient number, since it is larger than the sum of its proper divisors (21177189434103).
51351711282057 is a wasteful number, since it uses less digits than its factorization.
51351711282057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117570873.
The product of its (nonzero) digits is 588000, while the sum is 48.
The spelling of 51351711282057 in words is "fifty-one trillion, three hundred fifty-one billion, seven hundred eleven million, two hundred eighty-two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •