Base | Representation |
---|---|
bin | 1100010001110… |
… | …0010011011000 |
3 | 10120220021102220 |
4 | 3010130103120 |
5 | 101140334102 |
6 | 5035424040 |
7 | 1163465361 |
oct | 304342330 |
9 | 116807386 |
10 | 51496152 |
11 | 27082904 |
12 | 152b5020 |
13 | a8903c6 |
14 | 6ba6b68 |
15 | 47c31bc |
hex | 311c4d8 |
51496152 has 32 divisors (see below), whose sum is σ = 129470400. Its totient is φ = 17068064.
The previous prime is 51496147. The next prime is 51496169. The reversal of 51496152 is 25169415.
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 7 ways as a sum of consecutive naturals, for example, 1698 + ... + 10289.
It is an arithmetic number, because the mean of its divisors is an integer number (4045950).
Almost surely, 251496152 is an apocalyptic number.
It is an amenable number.
51496152 is an abundant number, since it is smaller than the sum of its proper divisors (77974248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51496152 is a wasteful number, since it uses less digits than its factorization.
51496152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12175 (or 12171 counting only the distinct ones).
The product of its digits is 10800, while the sum is 33.
The square root of 51496152 is about 7176.0819393315. The cubic root of 51496152 is about 372.0416764499.
The spelling of 51496152 in words is "fifty-one million, four hundred ninety-six thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •