Base | Representation |
---|---|
bin | 1100001011010… |
… | …0100011100111 |
3 | 10120002200112012 |
4 | 3002310203213 |
5 | 101033234312 |
6 | 5022344435 |
7 | 1160045435 |
oct | 302644347 |
9 | 116080465 |
10 | 51071207 |
11 | 26912610 |
12 | 1512b11b |
13 | a771b65 |
14 | 6ad5d55 |
15 | 473c322 |
hex | 30b48e7 |
51071207 has 8 divisors (see below), whose sum is σ = 56236032. Its totient is φ = 45993400.
The previous prime is 51071197. The next prime is 51071227. The reversal of 51071207 is 70217015.
It is a happy number.
51071207 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 51071207 - 24 = 51071191 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51071227) 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 7 ways as a sum of consecutive naturals, for example, 20519 + ... + 22872.
It is an arithmetic number, because the mean of its divisors is an integer number (7029504).
Almost surely, 251071207 is an apocalyptic number.
51071207 is a deficient number, since it is larger than the sum of its proper divisors (5164825).
51071207 is a wasteful number, since it uses less digits than its factorization.
51071207 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43509.
The product of its (nonzero) digits is 490, while the sum is 23.
The square root of 51071207 is about 7146.4121767500. The cubic root of 51071207 is about 371.0154889240.
It can be divided in two parts, 510 and 71207, that added together give a palindrome (71717).
The spelling of 51071207 in words is "fifty-one million, seventy-one thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •