Base | Representation |
---|---|
bin | 1100001111011… |
… | …1101011101000 |
3 | 10120121122200100 |
4 | 3003313223220 |
5 | 101121034102 |
6 | 5032305400 |
7 | 1162302144 |
oct | 303675350 |
9 | 116548610 |
10 | 51346152 |
11 | 26a90140 |
12 | 15242260 |
13 | a83a050 |
14 | 6b68224 |
15 | 4793a1c |
hex | 30f7ae8 |
51346152 has 96 divisors (see below), whose sum is σ = 163406880. Its totient is φ = 14359680.
The previous prime is 51346117. The next prime is 51346157. The reversal of 51346152 is 25164315.
It is not an unprimeable number, because it can be changed into a prime (51346157) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7803 + ... + 12789.
It is an arithmetic number, because the mean of its divisors is an integer number (1702155).
Almost surely, 251346152 is an apocalyptic number.
51346152 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 51346152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (81703440).
51346152 is an abundant number, since it is smaller than the sum of its proper divisors (112060728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51346152 is a wasteful number, since it uses less digits than its factorization.
51346152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5023 (or 5016 counting only the distinct ones).
The product of its digits is 3600, while the sum is 27.
The square root of 51346152 is about 7165.6229317485. The cubic root of 51346152 is about 371.6800926420.
It can be divided in two parts, 513 and 46152, that added together give a triangular number (46665 = T305).
The spelling of 51346152 in words is "fifty-one million, three hundred forty-six thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •