Base | Representation |
---|---|
bin | 1100010000001… |
… | …1001001110101 |
3 | 10120201001010200 |
4 | 3010003021311 |
5 | 101124040031 |
6 | 5033311113 |
7 | 1162556142 |
oct | 304031165 |
9 | 116631120 |
10 | 51393141 |
11 | 27012478 |
12 | 15265499 |
13 | a855557 |
14 | 6b7b3c9 |
15 | 47a28e6 |
hex | 3103275 |
51393141 has 6 divisors (see below), whose sum is σ = 74234550. Its totient is φ = 34262088.
The previous prime is 51393113. The next prime is 51393161. The reversal of 51393141 is 14139315.
51393141 is a `hidden beast` number, since 513 + 9 + 3 + 141 = 666.
It can be written as a sum of positive squares in only one way, i.e., 41602500 + 9790641 = 6450^2 + 3129^2 .
It is not a de Polignac number, because 51393141 - 29 = 51392629 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51393161) 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 5 ways as a sum of consecutive naturals, for example, 2855166 + ... + 2855183.
It is an arithmetic number, because the mean of its divisors is an integer number (12372425).
Almost surely, 251393141 is an apocalyptic number.
It is an amenable number.
51393141 is a deficient number, since it is larger than the sum of its proper divisors (22841409).
51393141 is a wasteful number, since it uses less digits than its factorization.
51393141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5710355 (or 5710352 counting only the distinct ones).
The product of its digits is 1620, while the sum is 27.
The square root of 51393141 is about 7168.9009617932. The cubic root of 51393141 is about 371.7934380456.
It can be divided in two parts, 5139314 and 1, that added together give a palindrome (5139315).
The spelling of 51393141 in words is "fifty-one million, three hundred ninety-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •