Base | Representation |
---|---|
bin | 101111111110011000… |
… | …000001100111111111 |
3 | 11220221222120120111102 |
4 | 233332120001213333 |
5 | 1320444130214411 |
6 | 35355304243315 |
7 | 3502344522005 |
oct | 577630014777 |
9 | 156858516442 |
10 | 51512351231 |
11 | 1a934419a00 |
12 | 9b9747053b |
13 | 4b1c197b03 |
14 | 26c952aa75 |
15 | 151752dd3b |
hex | bfe6019ff |
51512351231 has 48 divisors (see below), whose sum is σ = 59048220672. Its totient is φ = 44874023040.
The previous prime is 51512351227. The next prime is 51512351257. The reversal of 51512351231 is 13215321515.
It is not a de Polignac number, because 51512351231 - 22 = 51512351227 is a prime.
It is a super-2 number, since 2×515123512312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 51512351194 and 51512351203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51512351531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 69329846 + ... + 69330588.
It is an arithmetic number, because the mean of its divisors is an integer number (1230171264).
Almost surely, 251512351231 is an apocalyptic number.
51512351231 is a deficient number, since it is larger than the sum of its proper divisors (7535869441).
51512351231 is a wasteful number, since it uses less digits than its factorization.
51512351231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1052 (or 1041 counting only the distinct ones).
The product of its digits is 4500, while the sum is 29.
Adding to 51512351231 its reverse (13215321515), we get a palindrome (64727672746).
The spelling of 51512351231 in words is "fifty-one billion, five hundred twelve million, three hundred fifty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •