Base | Representation |
---|---|
bin | 101111101000111001… |
… | …110100101000001101 |
3 | 11220000212201112100220 |
4 | 233220321310220031 |
5 | 1314224420042031 |
6 | 35255435141553 |
7 | 3460411531164 |
oct | 575071645015 |
9 | 156025645326 |
10 | 51152112141 |
11 | 1a76a040a49 |
12 | 9ab68a48b9 |
13 | 4a926682a0 |
14 | 26937563db |
15 | 14e5ac1596 |
hex | be8e74a0d |
51152112141 has 32 divisors (see below), whose sum is σ = 77787480960. Its totient is φ = 29619800064.
The previous prime is 51152112091. The next prime is 51152112163. The reversal of 51152112141 is 14121125115.
It is not a de Polignac number, because 51152112141 - 27 = 51152112013 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51152112181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5417961 + ... + 5427393.
It is an arithmetic number, because the mean of its divisors is an integer number (2430858780).
Almost surely, 251152112141 is an apocalyptic number.
51152112141 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
It is an amenable number.
51152112141 is a deficient number, since it is larger than the sum of its proper divisors (26635368819).
51152112141 is a wasteful number, since it uses less digits than its factorization.
51152112141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17645.
The product of its digits is 400, while the sum is 24.
Adding to 51152112141 its reverse (14121125115), we get a palindrome (65273237256).
The spelling of 51152112141 in words is "fifty-one billion, one hundred fifty-two million, one hundred twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •