Base | Representation |
---|---|
bin | 1100001011000… |
… | …0100000010110 |
3 | 10120001211202122 |
4 | 3002300200112 |
5 | 101032221424 |
6 | 5022135542 |
7 | 1156646162 |
oct | 302604026 |
9 | 116054678 |
10 | 51054614 |
11 | 269010a6 |
12 | 151215b2 |
13 | a767440 |
14 | 6acdca2 |
15 | 473745e |
hex | 30b0816 |
51054614 has 8 divisors (see below), whose sum is σ = 82472880. Its totient is φ = 23563656.
The previous prime is 51054611. The next prime is 51054617. The reversal of 51054614 is 41645015.
It is an interprime number because it is at equal distance from previous prime (51054611) and next prime (51054617).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×510546142 = 5213147221377992, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (26), and also a Moran number because the ratio is a prime number: 1963639 = 51054614 / (5 + 1 + 0 + 5 + 4 + 6 + 1 + 4).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51054611) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 981794 + ... + 981845.
It is an arithmetic number, because the mean of its divisors is an integer number (10309110).
Almost surely, 251054614 is an apocalyptic number.
51054614 is a deficient number, since it is larger than the sum of its proper divisors (31418266).
51054614 is a wasteful number, since it uses less digits than its factorization.
51054614 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1963654.
The product of its (nonzero) digits is 2400, while the sum is 26.
The square root of 51054614 is about 7145.2511502396. The cubic root of 51054614 is about 370.9753036793.
Adding to 51054614 its reverse (41645015), we get a palindrome (92699629).
The spelling of 51054614 in words is "fifty-one million, fifty-four thousand, six hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •