Base | Representation |
---|---|
bin | 1100010101110… |
… | …1010111110000 |
3 | 10121101211001000 |
4 | 3011131113300 |
5 | 101222401142 |
6 | 5045242000 |
7 | 1165655403 |
oct | 305352760 |
9 | 117354030 |
10 | 51762672 |
11 | 27245075 |
12 | 15403300 |
13 | a954800 |
14 | 6c35d3a |
15 | 482714c |
hex | 315d5f0 |
51762672 has 120 divisors (see below), whose sum is σ = 161113200. Its totient is φ = 15904512.
The previous prime is 51762629. The next prime is 51762677. The reversal of 51762672 is 27626715.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51762677) 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, 72654 + ... + 73362.
It is an arithmetic number, because the mean of its divisors is an integer number (1342610).
Almost surely, 251762672 is an apocalyptic number.
51762672 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 51762672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (80556600).
51762672 is an abundant number, since it is smaller than the sum of its proper divisors (109350528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51762672 is a wasteful number, since it uses less digits than its factorization.
51762672 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 752 (or 727 counting only the distinct ones).
The product of its digits is 35280, while the sum is 36.
The square root of 51762672 is about 7194.6279959425. The cubic root of 51762672 is about 372.6824102477.
The spelling of 51762672 in words is "fifty-one million, seven hundred sixty-two thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •