Base | Representation |
---|---|
bin | 1100001010101… |
… | …0110001001001 |
3 | 10120000122112020 |
4 | 3002222301021 |
5 | 101030443423 |
6 | 5021435053 |
7 | 1156520520 |
oct | 302526111 |
9 | 116018466 |
10 | 51031113 |
11 | 26895481 |
12 | 1510ba89 |
13 | a759833 |
14 | 6ac54b7 |
15 | 47304e3 |
hex | 30aac49 |
51031113 has 16 divisors (see below), whose sum is σ = 77884800. Its totient is φ = 29114496.
The previous prime is 51031109. The next prime is 51031117. The reversal of 51031113 is 31113015.
It is an interprime number because it is at equal distance from previous prime (51031109) and next prime (51031117).
It is not a de Polignac number, because 51031113 - 22 = 51031109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 51031092 and 51031101.
It is not an unprimeable number, because it can be changed into a prime (51031117) 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 15 ways as a sum of consecutive naturals, for example, 15213 + ... + 18261.
It is an arithmetic number, because the mean of its divisors is an integer number (4867800).
Almost surely, 251031113 is an apocalyptic number.
It is an amenable number.
51031113 is a deficient number, since it is larger than the sum of its proper divisors (26853687).
51031113 is a wasteful number, since it uses less digits than its factorization.
51031113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3856.
The product of its (nonzero) digits is 45, while the sum is 15.
The square root of 51031113 is about 7143.6064421271. The cubic root of 51031113 is about 370.9183736066.
Adding to 51031113 its reverse (31113015), we get a palindrome (82144128).
It can be divided in two parts, 5103 and 1113, that added together give a triangular number (6216 = T111).
The spelling of 51031113 in words is "fifty-one million, thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •