Base | Representation |
---|---|
bin | 10111010011100110011111… |
… | …01100001001000101011011 |
3 | 20201110112212200202221010212 |
4 | 23221303033230021011123 |
5 | 23204144104230344011 |
6 | 301000222230401335 |
7 | 13536523256061050 |
oct | 1351631754110533 |
9 | 221415780687125 |
10 | 51251034231131 |
11 | 1536a4947913a9 |
12 | 58b896380024b |
13 | 2279c4b111687 |
14 | c927c5961027 |
15 | 5dd254dd408b |
hex | 2e9ccfb0915b |
51251034231131 has 8 divisors (see below), whose sum is σ = 58772517072864. Its totient is φ = 43779528020160.
The previous prime is 51251034231107. The next prime is 51251034231167. The reversal of 51251034231131 is 13113243015215.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 51251034231131 - 210 = 51251034230107 is a prime.
It is a super-2 number, since 2×512510342311312 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (51251034281131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12494155490 + ... + 12494159591.
It is an arithmetic number, because the mean of its divisors is an integer number (7346564634108).
Almost surely, 251251034231131 is an apocalyptic number.
51251034231131 is a deficient number, since it is larger than the sum of its proper divisors (7521482841733).
51251034231131 is a wasteful number, since it uses less digits than its factorization.
51251034231131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24988315381.
The product of its (nonzero) digits is 10800, while the sum is 32.
Adding to 51251034231131 its reverse (13113243015215), we get a palindrome (64364277246346).
The spelling of 51251034231131 in words is "fifty-one trillion, two hundred fifty-one billion, thirty-four million, two hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •