Base | Representation |
---|---|
bin | 1100001100011… |
… | …1101101001010 |
3 | 10120020200010012 |
4 | 3003013231022 |
5 | 101043242032 |
6 | 5024151522 |
7 | 1160523215 |
oct | 303075512 |
9 | 116220105 |
10 | 51149642 |
11 | 26966535 |
12 | 151685a2 |
13 | a79b77b |
14 | 6b1677c |
15 | 47556b2 |
hex | 30c7b4a |
51149642 has 4 divisors (see below), whose sum is σ = 76724466. Its totient is φ = 25574820.
The previous prime is 51149639. The next prime is 51149687. The reversal of 51149642 is 24694115.
51149642 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 32478601 + 18671041 = 5699^2 + 4321^2 .
It is a junction number, because it is equal to n+sod(n) for n = 51149599 and 51149608.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 12787409 + ... + 12787412.
Almost surely, 251149642 is an apocalyptic number.
51149642 is a deficient number, since it is larger than the sum of its proper divisors (25574824).
51149642 is a wasteful number, since it uses less digits than its factorization.
51149642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25574823.
The product of its digits is 8640, while the sum is 32.
The square root of 51149642 is about 7151.8977900974. The cubic root of 51149642 is about 371.2053265824.
The spelling of 51149642 in words is "fifty-one million, one hundred forty-nine thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.224 sec. • engine limits •