Base | Representation |
---|---|
bin | 1100001100011… |
… | …0100110101011 |
3 | 10120020102221010 |
4 | 3003012212223 |
5 | 101043121011 |
6 | 5024115003 |
7 | 1160504112 |
oct | 303064653 |
9 | 116212833 |
10 | 51145131 |
11 | 26963104 |
12 | 15165a63 |
13 | a7996bb |
14 | 6b14c79 |
15 | 47541a6 |
hex | 30c69ab |
51145131 has 16 divisors (see below), whose sum is σ = 72109440. Its totient is φ = 32155200.
The previous prime is 51145121. The next prime is 51145219. The reversal of 51145131 is 13154115.
It is a happy number.
51145131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 51145131 - 211 = 51143083 is a prime.
It is a super-2 number, since 2×511451312 = 5231648850014322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 51145098 and 51145107.
It is not an unprimeable number, because it can be changed into a prime (51145121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11356 + ... + 15206.
It is an arithmetic number, because the mean of its divisors is an integer number (4506840).
Almost surely, 251145131 is an apocalyptic number.
51145131 is a deficient number, since it is larger than the sum of its proper divisors (20964309).
51145131 is a wasteful number, since it uses less digits than its factorization.
51145131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4106.
The product of its digits is 300, while the sum is 21.
The square root of 51145131 is about 7151.5824123057. The cubic root of 51145131 is about 371.1944137888.
Adding to 51145131 its reverse (13154115), we get a palindrome (64299246).
The spelling of 51145131 in words is "fifty-one million, one hundred forty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •