Base | Representation |
---|---|
bin | 1100001100011… |
… | …1110111111011 |
3 | 10120020201001201 |
4 | 3003013313323 |
5 | 101043302311 |
6 | 5024155031 |
7 | 1160525221 |
oct | 303076773 |
9 | 116221051 |
10 | 51150331 |
11 | 26967001 |
12 | 15168a77 |
13 | a79bb8b |
14 | 6b16b11 |
15 | 47559c1 |
hex | 30c7dfb |
51150331 has 8 divisors (see below), whose sum is σ = 54719280. Its totient is φ = 47643648.
The previous prime is 51150293. The next prime is 51150343. The reversal of 51150331 is 13305115.
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 51150331 - 211 = 51148283 is a prime.
It is a super-2 number, since 2×511503312 = 5232712722819122, 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 = 51150299 and 51150308.
It is not an unprimeable number, because it can be changed into a prime (51150361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13861 + ... + 17158.
It is an arithmetic number, because the mean of its divisors is an integer number (6839910).
Almost surely, 251150331 is an apocalyptic number.
51150331 is a deficient number, since it is larger than the sum of its proper divisors (3568949).
51150331 is a wasteful number, since it uses less digits than its factorization.
51150331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31133.
The product of its (nonzero) digits is 225, while the sum is 19.
The square root of 51150331 is about 7151.9459589681. The cubic root of 51150331 is about 371.2069933214.
Adding to 51150331 its reverse (13305115), we get a palindrome (64455446).
The spelling of 51150331 in words is "fifty-one million, one hundred fifty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •