Base | Representation |
---|---|
bin | 1100001100100… |
… | …1010010100011 |
3 | 10120021000000112 |
4 | 3003021102203 |
5 | 101043444011 |
6 | 5024241535 |
7 | 1160551145 |
oct | 303112243 |
9 | 116230015 |
10 | 51156131 |
11 | 269703a4 |
12 | 151702ab |
13 | a7a1700 |
14 | 6b18c95 |
15 | 475758b |
hex | 30c94a3 |
51156131 has 12 divisors (see below), whose sum is σ = 55602720. Its totient is φ = 47043360.
The previous prime is 51156121. The next prime is 51156143. The reversal of 51156131 is 13165115.
It is not a de Polignac number, because 51156131 - 26 = 51156067 is a prime.
It is a super-2 number, since 2×511561312 = 5233899477778322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 51156097 and 51156106.
It is not an unprimeable number, because it can be changed into a prime (51156121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 70790 + ... + 71508.
It is an arithmetic number, because the mean of its divisors is an integer number (4633560).
Almost surely, 251156131 is an apocalyptic number.
51156131 is a deficient number, since it is larger than the sum of its proper divisors (4446589).
51156131 is a wasteful number, since it uses less digits than its factorization.
51156131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1166 (or 1153 counting only the distinct ones).
The product of its digits is 450, while the sum is 23.
The square root of 51156131 is about 7152.3514315224. The cubic root of 51156131 is about 371.2210233329.
The spelling of 51156131 in words is "fifty-one million, one hundred fifty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •