Base | Representation |
---|---|
bin | 1100001100001… |
… | …1001001101010 |
3 | 10120012201112020 |
4 | 3003003021222 |
5 | 101042142421 |
6 | 5023525310 |
7 | 1160414634 |
oct | 303031152 |
9 | 116181466 |
10 | 51130986 |
11 | 26953515 |
12 | 15159836 |
13 | a79312a |
14 | 6b0da54 |
15 | 474edc6 |
hex | 30c326a |
51130986 has 8 divisors (see below), whose sum is σ = 102261984. Its totient is φ = 17043660.
The previous prime is 51130969. The next prime is 51130987. The reversal of 51130986 is 68903115.
It is a sphenic number, since it is the product of 3 distinct primes.
51130986 is an admirable number.
It is a super-2 number, since 2×511309862 = 5228755458664392, which contains 22 as substring.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (51130987) 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, 4260910 + ... + 4260921.
It is an arithmetic number, because the mean of its divisors is an integer number (12782748).
Almost surely, 251130986 is an apocalyptic number.
51130986 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51130986 is a wasteful number, since it uses less digits than its factorization.
51130986 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8521836.
The product of its (nonzero) digits is 6480, while the sum is 33.
The square root of 51130986 is about 7150.5934019492. The cubic root of 51130986 is about 371.1601907259.
The spelling of 51130986 in words is "fifty-one million, one hundred thirty thousand, nine hundred eighty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •