Base | Representation |
---|---|
bin | 1100001111010… |
… | …0000100001101 |
3 | 10120120220100210 |
4 | 3003310010031 |
5 | 101120100331 |
6 | 5032113033 |
7 | 1162211025 |
oct | 303640415 |
9 | 116526323 |
10 | 51331341 |
11 | 26a7aaa6 |
12 | 15235779 |
13 | a833399 |
14 | 6b62a85 |
15 | 478e446 |
hex | 30f410d |
51331341 has 4 divisors (see below), whose sum is σ = 68441792. Its totient is φ = 34220892.
The previous prime is 51331327. The next prime is 51331351. The reversal of 51331341 is 14313315.
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 51331341 - 27 = 51331213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51331351) 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, 8555221 + ... + 8555226.
It is an arithmetic number, because the mean of its divisors is an integer number (17110448).
Almost surely, 251331341 is an apocalyptic number.
It is an amenable number.
51331341 is a deficient number, since it is larger than the sum of its proper divisors (17110451).
51331341 is a wasteful number, since it uses less digits than its factorization.
51331341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17110450.
The product of its digits is 540, while the sum is 21.
The square root of 51331341 is about 7164.5893811160. The cubic root of 51331341 is about 371.6443516758.
Adding to 51331341 its reverse (14313315), we get a palindrome (65644656).
It can be divided in two parts, 51 and 331341, that multiplied together give a triangular number (16898391 = T5813).
The spelling of 51331341 in words is "fifty-one million, three hundred thirty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •