Base | Representation |
---|---|
bin | 1100001100010… |
… | …1100110001001 |
3 | 10120020020021011 |
4 | 3003011212021 |
5 | 101043003001 |
6 | 5024043521 |
7 | 1160456062 |
oct | 303054611 |
9 | 116206234 |
10 | 51141001 |
11 | 2695aa9a |
12 | 151635a1 |
13 | a797862 |
14 | 6b13569 |
15 | 4752d51 |
hex | 30c5989 |
51141001 has 4 divisors (see below), whose sum is σ = 51219972. Its totient is φ = 51062032.
The previous prime is 51140987. The next prime is 51141011. The reversal of 51141001 is 10014115.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 10014115 = 5 ⋅2002823.
It can be written as a sum of positive squares in 2 ways, for example, as 18662400 + 32478601 = 4320^2 + 5699^2 .
It is a cyclic number.
It is not a de Polignac number, because 51141001 - 211 = 51138953 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51141011) 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, 38506 + ... + 39811.
It is an arithmetic number, because the mean of its divisors is an integer number (12804993).
Almost surely, 251141001 is an apocalyptic number.
It is an amenable number.
51141001 is a deficient number, since it is larger than the sum of its proper divisors (78971).
51141001 is an equidigital number, since it uses as much as digits as its factorization.
51141001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78970.
The product of its (nonzero) digits is 20, while the sum is 13.
The square root of 51141001 is about 7151.2936591920. The cubic root of 51141001 is about 371.1844221293.
Adding to 51141001 its reverse (10014115), we get a palindrome (61155116).
The spelling of 51141001 in words is "fifty-one million, one hundred forty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •