Base | Representation |
---|---|
bin | 1100001110111… |
… | …1111000000100 |
3 | 10120120000211012 |
4 | 3003233320010 |
5 | 101114023210 |
6 | 5031501352 |
7 | 1162110011 |
oct | 303577004 |
9 | 116500735 |
10 | 51314180 |
11 | 26a69115 |
12 | 15227858 |
13 | a828628 |
14 | 6b5a708 |
15 | 4789305 |
hex | 30efe04 |
51314180 has 12 divisors (see below), whose sum is σ = 107759820. Its totient is φ = 20525664.
The previous prime is 51314167. The next prime is 51314183. The reversal of 51314180 is 8141315.
51314180 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 33200644 + 18113536 = 5762^2 + 4256^2 .
It is not an unprimeable number, because it can be changed into a prime (51314183) 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, 1282835 + ... + 1282874.
It is an arithmetic number, because the mean of its divisors is an integer number (8979985).
Almost surely, 251314180 is an apocalyptic number.
It is an amenable number.
51314180 is an abundant number, since it is smaller than the sum of its proper divisors (56445640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51314180 is a wasteful number, since it uses less digits than its factorization.
51314180 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2565718 (or 2565716 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 23.
The square root of 51314180 is about 7163.3916547959. The cubic root of 51314180 is about 371.6029312397.
Adding to 51314180 its reverse (8141315), we get a palindrome (59455495).
The spelling of 51314180 in words is "fifty-one million, three hundred fourteen thousand, one hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •