Base | Representation |
---|---|
bin | 1100011001011… |
… | …0100110101001 |
3 | 10121211201121102 |
4 | 3012112212221 |
5 | 101302401342 |
6 | 5054251145 |
7 | 1200653015 |
oct | 306264651 |
9 | 117751542 |
10 | 51997097 |
11 | 27395209 |
12 | 154b6ab5 |
13 | aa07419 |
14 | 6c97545 |
15 | 4871832 |
hex | 31969a9 |
51997097 has 4 divisors (see below), whose sum is σ = 52709460. Its totient is φ = 51284736.
The previous prime is 51997073. The next prime is 51997111. The reversal of 51997097 is 79079915.
It is a happy number.
51997097 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 24790441 + 27206656 = 4979^2 + 5216^2 .
It is a cyclic number.
It is not a de Polignac number, because 51997097 - 212 = 51993001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51997007) 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, 356072 + ... + 356217.
It is an arithmetic number, because the mean of its divisors is an integer number (13177365).
Almost surely, 251997097 is an apocalyptic number.
It is an amenable number.
51997097 is a deficient number, since it is larger than the sum of its proper divisors (712363).
51997097 is an equidigital number, since it uses as much as digits as its factorization.
51997097 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 712362.
The product of its (nonzero) digits is 178605, while the sum is 47.
The square root of 51997097 is about 7210.9012612849. The cubic root of 51997097 is about 373.2441697320.
The spelling of 51997097 in words is "fifty-one million, nine hundred ninety-seven thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •