Base | Representation |
---|---|
bin | 1100010101001… |
… | …1010111000101 |
3 | 10121022201210101 |
4 | 3011103113011 |
5 | 101220043134 |
6 | 5044324101 |
7 | 1165425016 |
oct | 305232705 |
9 | 117281711 |
10 | 51721669 |
11 | 2721728a |
12 | 153a3631 |
13 | a93bc4c |
14 | 6c2500d |
15 | 4819e14 |
hex | 31535c5 |
51721669 has 2 divisors, whose sum is σ = 51721670. Its totient is φ = 51721668.
The previous prime is 51721643. The next prime is 51721673. The reversal of 51721669 is 96612715.
51721669 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., 42419169 + 9302500 = 6513^2 + 3050^2 .
It is a cyclic number.
It is not a de Polignac number, because 51721669 - 211 = 51719621 is a prime.
It is a super-2 number, since 2×517216692 = 5350262088291122, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51721619) 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, 25860834 + 25860835.
It is an arithmetic number, because the mean of its divisors is an integer number (25860835).
Almost surely, 251721669 is an apocalyptic number.
It is an amenable number.
51721669 is a deficient number, since it is larger than the sum of its proper divisors (1).
51721669 is an equidigital number, since it uses as much as digits as its factorization.
51721669 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 22680, while the sum is 37.
The square root of 51721669 is about 7191.7778747678. Note that the first 3 decimals coincide. The cubic root of 51721669 is about 372.5839793840.
The spelling of 51721669 in words is "fifty-one million, seven hundred twenty-one thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •