Base | Representation |
---|---|
bin | 1100011000001… |
… | …0011110111001 |
3 | 10121200112112222 |
4 | 3012002132321 |
5 | 101242232211 |
6 | 5052413425 |
7 | 1200160520 |
oct | 306023671 |
9 | 117615488 |
10 | 51914681 |
11 | 273392a5 |
12 | 15477275 |
13 | a9a8a60 |
14 | 6c754b7 |
15 | 48571db |
hex | 31827b9 |
51914681 has 8 divisors (see below), whose sum is σ = 63895104. Its totient is φ = 41075280.
The previous prime is 51914671. The next prime is 51914683. The reversal of 51914681 is 18641915.
51914681 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 51914681 - 210 = 51913657 is a prime.
It is a super-4 number, since 4×519146814 (a number of 32 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (51914683) 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, 285155 + ... + 285336.
It is an arithmetic number, because the mean of its divisors is an integer number (7986888).
Almost surely, 251914681 is an apocalyptic number.
It is an amenable number.
51914681 is a deficient number, since it is larger than the sum of its proper divisors (11980423).
51914681 is a wasteful number, since it uses less digits than its factorization.
51914681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 570511.
The product of its digits is 8640, while the sum is 35.
The square root of 51914681 is about 7205.1843140894. The cubic root of 51914681 is about 373.0468666778.
The spelling of 51914681 in words is "fifty-one million, nine hundred fourteen thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •