Base | Representation |
---|---|
bin | 1100010001010… |
… | …1111001010011 |
3 | 10120211221102212 |
4 | 3010111321103 |
5 | 101134014112 |
6 | 5035102335 |
7 | 1163326016 |
oct | 304257123 |
9 | 116757385 |
10 | 51469907 |
11 | 27065115 |
12 | 152a19ab |
13 | a881488 |
14 | 6b9b37d |
15 | 47ba522 |
hex | 3115e53 |
51469907 has 2 divisors, whose sum is σ = 51469908. Its totient is φ = 51469906.
The previous prime is 51469823. The next prime is 51469937. The reversal of 51469907 is 70996415.
51469907 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 is a cyclic number.
It is not a de Polignac number, because 51469907 - 212 = 51465811 is a prime.
It is a super-3 number, since 3×514699073 (a number of 24 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (51469937) 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, 25734953 + 25734954.
It is an arithmetic number, because the mean of its divisors is an integer number (25734954).
Almost surely, 251469907 is an apocalyptic number.
51469907 is a deficient number, since it is larger than the sum of its proper divisors (1).
51469907 is an equidigital number, since it uses as much as digits as its factorization.
51469907 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 68040, while the sum is 41.
The square root of 51469907 is about 7174.2530621661. The cubic root of 51469907 is about 371.9784620629.
The spelling of 51469907 in words is "fifty-one million, four hundred sixty-nine thousand, nine hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •