Base | Representation |
---|---|
bin | 10111001101000110101000… |
… | …00111100010000001100111 |
3 | 20200200012121001011001202112 |
4 | 23212203110013202001213 |
5 | 23142014333134030042 |
6 | 300305500052031235 |
7 | 13514430500230433 |
oct | 1346432407420147 |
9 | 220605531131675 |
10 | 51027770220647 |
11 | 15293834aa8860 |
12 | 588163500251b |
13 | 2261b8a12682c |
14 | c85a85ca99c3 |
15 | 5d753939e982 |
hex | 2e68d41e2067 |
51027770220647 has 16 divisors (see below), whose sum is σ = 58944103460352. Its totient is φ = 43657949646720.
The previous prime is 51027770220611. The next prime is 51027770220649. The reversal of 51027770220647 is 74602207772015.
It is a cyclic number.
It is not a de Polignac number, because 51027770220647 - 28 = 51027770220391 is a prime.
It is a super-3 number, since 3×510277702206473 (a number of 42 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 51027770220595 and 51027770220604.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51027770220649) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3025583 + ... + 10545600.
It is an arithmetic number, because the mean of its divisors is an integer number (3684006466272).
Almost surely, 251027770220647 is an apocalyptic number.
51027770220647 is a deficient number, since it is larger than the sum of its proper divisors (7916333239705).
51027770220647 is a wasteful number, since it uses less digits than its factorization.
51027770220647 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13591318.
The product of its (nonzero) digits is 2304960, while the sum is 50.
The spelling of 51027770220647 in words is "fifty-one trillion, twenty-seven billion, seven hundred seventy million, two hundred twenty thousand, six hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •