Base | Representation |
---|---|
bin | 1100001110010… |
… | …1001001011000 |
3 | 10120110210112111 |
4 | 3003211021120 |
5 | 101111121412 |
6 | 5030522104 |
7 | 1161534616 |
oct | 303451130 |
9 | 116423474 |
10 | 51270232 |
11 | 26a390a2 |
12 | 15206334 |
13 | a811620 |
14 | 6b486b6 |
15 | 477b2a7 |
hex | 30e5258 |
51270232 has 64 divisors (see below), whose sum is σ = 112129920. Its totient is φ = 21762048.
The previous prime is 51270229. The next prime is 51270259. The reversal of 51270232 is 23207215.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 82788 + ... + 83404.
It is an arithmetic number, because the mean of its divisors is an integer number (1752030).
Almost surely, 251270232 is an apocalyptic number.
51270232 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 51270232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (56064960).
51270232 is an abundant number, since it is smaller than the sum of its proper divisors (60859688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51270232 is a wasteful number, since it uses less digits than its factorization.
51270232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 700 (or 696 counting only the distinct ones).
The product of its (nonzero) digits is 840, while the sum is 22.
The square root of 51270232 is about 7160.3234563810. The cubic root of 51270232 is about 371.4968145670.
Adding to 51270232 its reverse (23207215), we get a palindrome (74477447).
The spelling of 51270232 in words is "fifty-one million, two hundred seventy thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •