Base | Representation |
---|---|
bin | 1100010010000… |
… | …0001100100101 |
3 | 10120221002022121 |
4 | 3010200030211 |
5 | 101141341401 |
6 | 5040025541 |
7 | 1163563024 |
oct | 304401445 |
9 | 116832277 |
10 | 51512101 |
11 | 27093893 |
12 | 153022b1 |
13 | a897744 |
14 | 6bac8bb |
15 | 47c7ca1 |
hex | 3120325 |
51512101 has 2 divisors, whose sum is σ = 51512102. Its totient is φ = 51512100.
The previous prime is 51512099. The next prime is 51512107. The reversal of 51512101 is 10121515.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 41589601 + 9922500 = 6449^2 + 3150^2 .
It is a cyclic number.
It is not a de Polignac number, because 51512101 - 21 = 51512099 is a prime.
It is a super-4 number, since 4×515121014 (a number of 32 digits) contains 4444 as substring.
Together with 51512099, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51512107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25756050 + 25756051.
It is an arithmetic number, because the mean of its divisors is an integer number (25756051).
Almost surely, 251512101 is an apocalyptic number.
It is an amenable number.
51512101 is a deficient number, since it is larger than the sum of its proper divisors (1).
51512101 is an equidigital number, since it uses as much as digits as its factorization.
51512101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 50, while the sum is 16.
The square root of 51512101 is about 7177.1931143031. The cubic root of 51512101 is about 372.0800811332.
Adding to 51512101 its reverse (10121515), we get a palindrome (61633616).
The spelling of 51512101 in words is "fifty-one million, five hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •