Base | Representation |
---|---|
bin | 1100001010001… |
… | …1001011101011 |
3 | 10112222001220111 |
4 | 3002203023223 |
5 | 101024000133 |
6 | 5021035151 |
7 | 1156331113 |
oct | 302431353 |
9 | 115861814 |
10 | 51000043 |
11 | 268740a6 |
12 | 150b5ab7 |
13 | a748653 |
14 | 6ab8043 |
15 | 47261cd |
hex | 30a32eb |
51000043 has 4 divisors (see below), whose sum is σ = 51015888. Its totient is φ = 50984200.
The previous prime is 51000041. The next prime is 51000049. The reversal of 51000043 is 34000015.
51000043 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 is a cyclic number.
It is not a de Polignac number, because 51000043 - 21 = 51000041 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50999987 and 51000032.
It is not an unprimeable number, because it can be changed into a prime (51000041) by changing a digit.
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 in 3 ways as a sum of consecutive naturals, for example, 1183 + ... + 10168.
It is an arithmetic number, because the mean of its divisors is an integer number (12753972).
Almost surely, 251000043 is an apocalyptic number.
51000043 is a deficient number, since it is larger than the sum of its proper divisors (15845).
51000043 is a wasteful number, since it uses less digits than its factorization.
51000043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15844.
The product of its (nonzero) digits is 60, while the sum is 13.
The square root of 51000043 is about 7141.4314391444. The cubic root of 51000043 is about 370.8430811504.
Adding to 51000043 its reverse (34000015), we get a palindrome (85000058).
The spelling of 51000043 in words is "fifty-one million, forty-three", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •