Base | Representation |
---|---|
bin | 1100010100001… |
… | …1010111000100 |
3 | 10121012101220002 |
4 | 3011003113010 |
5 | 101210444012 |
6 | 5043100432 |
7 | 1165032653 |
oct | 305032704 |
9 | 117171802 |
10 | 51656132 |
11 | 27182020 |
12 | 15371718 |
13 | a918178 |
14 | 6c0919a |
15 | 48057c2 |
hex | 31435c4 |
51656132 has 48 divisors (see below), whose sum is σ = 106468992. Its totient is φ = 21665280.
The previous prime is 51656131. The next prime is 51656179. The reversal of 51656132 is 23165615.
It is a Smith number, since the sum of its digits (29) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 51656095 and 51656104.
It is not an unprimeable number, because it can be changed into a prime (51656131) by changing a digit.
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, 38993 + ... + 40295.
It is an arithmetic number, because the mean of its divisors is an integer number (2218104).
Almost surely, 251656132 is an apocalyptic number.
It is an amenable number.
51656132 is an abundant number, since it is smaller than the sum of its proper divisors (54812860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51656132 is a wasteful number, since it uses less digits than its factorization.
51656132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1388 (or 1386 counting only the distinct ones).
The product of its digits is 5400, while the sum is 29.
The square root of 51656132 is about 7187.2200467218. The cubic root of 51656132 is about 372.4265446799.
It can be divided in two parts, 5165613 and 2, that added together give a palindrome (5165615).
The spelling of 51656132 in words is "fifty-one million, six hundred fifty-six thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •