Base | Representation |
---|---|
bin | 10111011001000111000101… |
… | …01000001001001100011100 |
3 | 20202010122111002010022011020 |
4 | 23230203202220021030130 |
5 | 23220244244102324012 |
6 | 301223210034524140 |
7 | 13556304225646233 |
oct | 1354434250111434 |
9 | 222118432108136 |
10 | 51440330511132 |
11 | 154327a3588312 |
12 | 5929592736650 |
13 | 2291a57a00a04 |
14 | c9ba22257b1a |
15 | 5e31337e0a8c |
hex | 2ec8e2a0931c |
51440330511132 has 24 divisors (see below), whose sum is σ = 120242926991376. Its totient is φ = 17115992675328.
The previous prime is 51440330511113. The next prime is 51440330511203. The reversal of 51440330511132 is 23111503304415.
It is a super-2 number, since 2×514403305111322 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 51440330511093 and 51440330511102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3848013253 + ... + 3848026620.
It is an arithmetic number, because the mean of its divisors is an integer number (5010121957974).
Almost surely, 251440330511132 is an apocalyptic number.
It is an amenable number.
51440330511132 is an abundant number, since it is smaller than the sum of its proper divisors (68802596480244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51440330511132 is a wasteful number, since it uses less digits than its factorization.
51440330511132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7696040437 (or 7696040435 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 33.
Adding to 51440330511132 its reverse (23111503304415), we get a palindrome (74551833815547).
The spelling of 51440330511132 in words is "fifty-one trillion, four hundred forty billion, three hundred thirty million, five hundred eleven thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •