Base | Representation |
---|---|
bin | 1100001011010… |
… | …0010011011101 |
3 | 10120002122002220 |
4 | 3002310103131 |
5 | 101033221143 |
6 | 5022335553 |
7 | 1160042430 |
oct | 302642335 |
9 | 116078086 |
10 | 51070173 |
11 | 26911860 |
12 | 1512a5b9 |
13 | a77154b |
14 | 6ad5817 |
15 | 473bd83 |
hex | 30b44dd |
51070173 has 16 divisors (see below), whose sum is σ = 84896256. Its totient is φ = 26529840.
The previous prime is 51070169. The next prime is 51070177. The reversal of 51070173 is 37107015.
51070173 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (51070169) and next prime (51070177).
It is not a de Polignac number, because 51070173 - 22 = 51070169 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51070177) 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 15 ways as a sum of consecutive naturals, for example, 110311 + ... + 110772.
It is an arithmetic number, because the mean of its divisors is an integer number (5306016).
Almost surely, 251070173 is an apocalyptic number.
It is an amenable number.
51070173 is a deficient number, since it is larger than the sum of its proper divisors (33826083).
51070173 is a wasteful number, since it uses less digits than its factorization.
51070173 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 221104.
The product of its (nonzero) digits is 735, while the sum is 24.
The square root of 51070173 is about 7146.3398323897. The cubic root of 51070173 is about 371.0129850174.
Adding to 51070173 its reverse (37107015), we get a palindrome (88177188).
The spelling of 51070173 in words is "fifty-one million, seventy thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •