Base | Representation |
---|---|
bin | 1100011000101… |
… | …1110100011001 |
3 | 10121202111000021 |
4 | 3012023310121 |
5 | 101244443141 |
6 | 5053310441 |
7 | 1200410146 |
oct | 306136431 |
9 | 117674007 |
10 | 51952921 |
11 | 27364aa9 |
12 | 15495421 |
13 | a9c0297 |
14 | 6c853cd |
15 | 48636d1 |
hex | 318bd19 |
51952921 has 4 divisors (see below), whose sum is σ = 53357092. Its totient is φ = 50548752.
The previous prime is 51952913. The next prime is 51952933. The reversal of 51952921 is 12925915.
51952921 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 30691600 + 21261321 = 5540^2 + 4611^2 .
It is a cyclic number.
It is not a de Polignac number, because 51952921 - 23 = 51952913 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51952951) 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 in 3 ways as a sum of consecutive naturals, for example, 702030 + ... + 702103.
It is an arithmetic number, because the mean of its divisors is an integer number (13339273).
Almost surely, 251952921 is an apocalyptic number.
It is an amenable number.
51952921 is a deficient number, since it is larger than the sum of its proper divisors (1404171).
51952921 is a wasteful number, since it uses less digits than its factorization.
51952921 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1404170.
The product of its digits is 8100, while the sum is 34.
The square root of 51952921 is about 7207.8374704207. The cubic root of 51952921 is about 373.1384387903.
The spelling of 51952921 in words is "fifty-one million, nine hundred fifty-two thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •