Base | Representation |
---|---|
bin | 1100010001001… |
… | …1111111111011 |
3 | 10120211112210011 |
4 | 3010103333323 |
5 | 101133242024 |
6 | 5035002351 |
7 | 1163264251 |
oct | 304237773 |
9 | 116745704 |
10 | 51462139 |
11 | 2705a2a3 |
12 | 152993b7 |
13 | a87aa91 |
14 | 6b985d1 |
15 | 47b8094 |
hex | 3113ffb |
51462139 has 4 divisors (see below), whose sum is σ = 53122240. Its totient is φ = 49802040.
The previous prime is 51462107. The next prime is 51462143. The reversal of 51462139 is 93126415.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 51462139 - 25 = 51462107 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31), and also a Moran number because the ratio is a prime number: 1660069 = 51462139 / (5 + 1 + 4 + 6 + 2 + 1 + 3 + 9).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 51462139.
It is not an unprimeable number, because it can be changed into a prime (51462239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 830004 + ... + 830065.
It is an arithmetic number, because the mean of its divisors is an integer number (13280560).
Almost surely, 251462139 is an apocalyptic number.
51462139 is a deficient number, since it is larger than the sum of its proper divisors (1660101).
51462139 is a wasteful number, since it uses less digits than its factorization.
51462139 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1660100.
The product of its digits is 6480, while the sum is 31.
The square root of 51462139 is about 7173.7116613368. The cubic root of 51462139 is about 371.9597477355.
The spelling of 51462139 in words is "fifty-one million, four hundred sixty-two thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •