Base | Representation |
---|---|
bin | 1100010001011… |
… | …1110010010000 |
3 | 10120212100001120 |
4 | 3010113302100 |
5 | 101134241043 |
6 | 5035202240 |
7 | 1163360415 |
oct | 304276220 |
9 | 116770046 |
10 | 51477648 |
11 | 2706aa12 |
12 | 152a6380 |
13 | a884b61 |
14 | 6ba010c |
15 | 47bc983 |
hex | 3117c90 |
51477648 has 40 divisors (see below), whose sum is σ = 134217600. Its totient is φ = 17000064.
The previous prime is 51477617. The next prime is 51477691. The reversal of 51477648 is 84677415.
It is a super-2 number, since 2×514776482 = 5299896487223808, which contains 22 as substring.
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 7 ways as a sum of consecutive naturals, for example, 313 + ... + 10151.
It is an arithmetic number, because the mean of its divisors is an integer number (3355440).
Almost surely, 251477648 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 51477648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (67108800).
51477648 is an abundant number, since it is smaller than the sum of its proper divisors (82739952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51477648 is a wasteful number, since it uses less digits than its factorization.
51477648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9959 (or 9953 counting only the distinct ones).
The product of its digits is 188160, while the sum is 42.
The square root of 51477648 is about 7174.7925405547. The cubic root of 51477648 is about 371.9971094700.
It can be divided in two parts, 51477 and 648, that added together give a palindrome (52125).
The spelling of 51477648 in words is "fifty-one million, four hundred seventy-seven thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •