Base | Representation |
---|---|
bin | 1100010000001… |
… | …1111010101101 |
3 | 10120201012102112 |
4 | 3010003322231 |
5 | 101124140034 |
6 | 5033333405 |
7 | 1162601231 |
oct | 304037255 |
9 | 116635375 |
10 | 51396269 |
11 | 27014861 |
12 | 15267265 |
13 | a856ac2 |
14 | 6b7c5c1 |
15 | 47a37ce |
hex | 3103ead |
51396269 has 2 divisors, whose sum is σ = 51396270. Its totient is φ = 51396268.
The previous prime is 51396263. The next prime is 51396299. The reversal of 51396269 is 96269315.
51396269 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 49519369 + 1876900 = 7037^2 + 1370^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51396269 is a prime.
It is a super-2 number, since 2×513962692 = 5283152934240722, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51396263) 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, 25698134 + 25698135.
It is an arithmetic number, because the mean of its divisors is an integer number (25698135).
Almost surely, 251396269 is an apocalyptic number.
It is an amenable number.
51396269 is a deficient number, since it is larger than the sum of its proper divisors (1).
51396269 is an equidigital number, since it uses as much as digits as its factorization.
51396269 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 87480, while the sum is 41.
The square root of 51396269 is about 7169.1191230164. The cubic root of 51396269 is about 371.8009808568.
The spelling of 51396269 in words is "fifty-one million, three hundred ninety-six thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •