Base | Representation |
---|---|
bin | 1100010100000… |
… | …1111001010111 |
3 | 10121012002122222 |
4 | 3011001321113 |
5 | 101210301020 |
6 | 5043012555 |
7 | 1165006325 |
oct | 305017127 |
9 | 117162588 |
10 | 51650135 |
11 | 27178569 |
12 | 1536a15b |
13 | a915514 |
14 | 6c06d15 |
15 | 4803b25 |
hex | 3141e57 |
51650135 has 4 divisors (see below), whose sum is σ = 61980168. Its totient is φ = 41320104.
The previous prime is 51650129. The next prime is 51650141. The reversal of 51650135 is 53105615.
51650135 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, and also an emirpimes, since its reverse is a distinct semiprime: 53105615 = 5 ⋅10621123.
It is an interprime number because it is at equal distance from previous prime (51650129) and next prime (51650141).
It is a cyclic number.
It is not a de Polignac number, because 51650135 - 220 = 50601559 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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, 5165009 + ... + 5165018.
It is an arithmetic number, because the mean of its divisors is an integer number (15495042).
Almost surely, 251650135 is an apocalyptic number.
51650135 is a deficient number, since it is larger than the sum of its proper divisors (10330033).
51650135 is a wasteful number, since it uses less digits than its factorization.
51650135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10330032.
The product of its (nonzero) digits is 2250, while the sum is 26.
The square root of 51650135 is about 7186.8028357539. The cubic root of 51650135 is about 372.4121318804.
The spelling of 51650135 in words is "fifty-one million, six hundred fifty thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •