Base | Representation |
---|---|
bin | 10111001111010110110000… |
… | …10101111011101110111100 |
3 | 20200221121022210211100210020 |
4 | 23213223120111323232330 |
5 | 23144301322013004111 |
6 | 300405214304212140 |
7 | 13523140162002552 |
oct | 1347533025735674 |
9 | 220847283740706 |
10 | 51105150516156 |
11 | 15313633181100 |
12 | 589462b60a050 |
13 | 226926c5a9939 |
14 | c89706b53bd2 |
15 | 5d9567899906 |
hex | 2e7ad857bbbc |
51105150516156 has 36 divisors (see below), whose sum is σ = 131071336451496. Its totient is φ = 15486409246880.
The previous prime is 51105150516071. The next prime is 51105150516157. The reversal of 51105150516156 is 65161505150115.
It is a super-2 number, since 2×511051505161562 (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 (51105150516157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 17598190875 + ... + 17598193778.
It is an arithmetic number, because the mean of its divisors is an integer number (3640870456986).
Almost surely, 251105150516156 is an apocalyptic number.
It is an amenable number.
51105150516156 is an abundant number, since it is smaller than the sum of its proper divisors (79966185935340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51105150516156 is a wasteful number, since it uses less digits than its factorization.
51105150516156 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35196384682 (or 35196384669 counting only the distinct ones).
The product of its (nonzero) digits is 112500, while the sum is 42.
The spelling of 51105150516156 in words is "fifty-one trillion, one hundred five billion, one hundred fifty million, five hundred sixteen thousand, one hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •