Base | Representation |
---|---|
bin | 1100001011110… |
… | …0111011100000 |
3 | 10120011102120110 |
4 | 3002330323200 |
5 | 101040334004 |
6 | 5023211320 |
7 | 1160250432 |
oct | 302747340 |
9 | 116142513 |
10 | 51105504 |
11 | 2693635a |
12 | 15146b40 |
13 | a784658 |
14 | 6b04652 |
15 | 4747589 |
hex | 30bcee0 |
51105504 has 24 divisors (see below), whose sum is σ = 134152200. Its totient is φ = 17035136.
The previous prime is 51105487. The next prime is 51105529. The reversal of 51105504 is 40550115.
51105504 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (24).
It is a super-2 number, since 2×511055042 = 5223545078188032, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 266079 + ... + 266270.
It is an arithmetic number, because the mean of its divisors is an integer number (5589675).
Almost surely, 251105504 is an apocalyptic number.
It is an amenable number.
51105504 is an abundant number, since it is smaller than the sum of its proper divisors (83046696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51105504 is a wasteful number, since it uses less digits than its factorization.
51105504 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 532362 (or 532354 counting only the distinct ones).
The product of its (nonzero) digits is 500, while the sum is 21.
The square root of 51105504 is about 7148.8113697313. The cubic root of 51105504 is about 371.0985224740.
Adding to 51105504 its reverse (40550115), we get a palindrome (91655619).
The spelling of 51105504 in words is "fifty-one million, one hundred five thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •