Base | Representation |
---|---|
bin | 1100010000111… |
… | …1110000000101 |
3 | 10120210122220210 |
4 | 3010033300011 |
5 | 101132212431 |
6 | 5034350033 |
7 | 1163162445 |
oct | 304176005 |
9 | 116718823 |
10 | 51444741 |
11 | 27048217 |
12 | 1528b319 |
13 | a872b9a |
14 | 6b92125 |
15 | 47b2d46 |
hex | 310fc05 |
51444741 has 4 divisors (see below), whose sum is σ = 68592992. Its totient is φ = 34296492.
The previous prime is 51444697. The next prime is 51444749. The reversal of 51444741 is 14744415.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 51444741 - 215 = 51411973 is a prime.
It is a super-2 number, since 2×514447412 = 5293122753114162, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 51444699 and 51444708.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51444749) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8574121 + ... + 8574126.
It is an arithmetic number, because the mean of its divisors is an integer number (17148248).
Almost surely, 251444741 is an apocalyptic number.
It is an amenable number.
51444741 is a deficient number, since it is larger than the sum of its proper divisors (17148251).
51444741 is a wasteful number, since it uses less digits than its factorization.
51444741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17148250.
The product of its digits is 8960, while the sum is 30.
The square root of 51444741 is about 7172.4989369117. The cubic root of 51444741 is about 371.9178263980.
The spelling of 51444741 in words is "fifty-one million, four hundred forty-four thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •