Base | Representation |
---|---|
bin | 1100001111001… |
… | …1110000001101 |
3 | 10120120211121101 |
4 | 3003303300031 |
5 | 101120030221 |
6 | 5032103101 |
7 | 1162204216 |
oct | 303636015 |
9 | 116524541 |
10 | 51330061 |
11 | 26a7a042 |
12 | 15234a91 |
13 | a832923 |
14 | 6b6240d |
15 | 478dd91 |
hex | 30f3c0d |
51330061 has 2 divisors, whose sum is σ = 51330062. Its totient is φ = 51330060.
The previous prime is 51330049. The next prime is 51330101. The reversal of 51330061 is 16003315.
51330061 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., 36360900 + 14969161 = 6030^2 + 3869^2 .
It is a cyclic number.
It is not a de Polignac number, because 51330061 - 215 = 51297293 is a prime.
It is the 7165-th Hogben number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51330031) by changing a digit.
It is a nontrivial repunit in base 7164.
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, 25665030 + 25665031.
It is an arithmetic number, because the mean of its divisors is an integer number (25665031).
Almost surely, 251330061 is an apocalyptic number.
It is an amenable number.
51330061 is a deficient number, since it is larger than the sum of its proper divisors (1).
51330061 is an equidigital number, since it uses as much as digits as its factorization.
51330061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 270, while the sum is 19.
The square root of 51330061 is about 7164.5000523414. The cubic root of 51330061 is about 371.6412625382.
Adding to 51330061 its reverse (16003315), we get a palindrome (67333376).
The spelling of 51330061 in words is "fifty-one million, three hundred thirty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •