Base | Representation |
---|---|
bin | 1100001100101… |
… | …1000101111001 |
3 | 10120021101010221 |
4 | 3003023011321 |
5 | 101044213023 |
6 | 5024340041 |
7 | 1160611522 |
oct | 303130571 |
9 | 116241127 |
10 | 51163513 |
11 | 269759a5 |
12 | 15174621 |
13 | a7a4b8b |
14 | 6b1b849 |
15 | 475985d |
hex | 30cb179 |
51163513 has 2 divisors, whose sum is σ = 51163514. Its totient is φ = 51163512.
The previous prime is 51163501. The next prime is 51163517. The reversal of 51163513 is 31536115.
51163513 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 49730704 + 1432809 = 7052^2 + 1197^2 .
It is a cyclic number.
It is not a de Polignac number, because 51163513 - 217 = 51032441 is a prime.
It is a super-3 number, since 3×511635133 (a number of 24 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (51163517) 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 as a sum of consecutive naturals, namely, 25581756 + 25581757.
It is an arithmetic number, because the mean of its divisors is an integer number (25581757).
Almost surely, 251163513 is an apocalyptic number.
It is an amenable number.
51163513 is a deficient number, since it is larger than the sum of its proper divisors (1).
51163513 is an equidigital number, since it uses as much as digits as its factorization.
51163513 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1350, while the sum is 25.
The square root of 51163513 is about 7152.8674669674. The cubic root of 51163513 is about 371.2388786172.
Adding to 51163513 its reverse (31536115), we get a palindrome (82699628).
The spelling of 51163513 in words is "fifty-one million, one hundred sixty-three thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •