Base | Representation |
---|---|
bin | 1100001101110… |
… | …1000001100100 |
3 | 10120102002220100 |
4 | 3003131001210 |
5 | 101104040324 |
6 | 5030104100 |
7 | 1161335622 |
oct | 303350144 |
9 | 116362810 |
10 | 51236964 |
11 | 26a160a9 |
12 | 151ab030 |
13 | a7cc43c |
14 | 6b3a512 |
15 | 47714c9 |
hex | 30dd064 |
51236964 has 27 divisors (see below), whose sum is σ = 129624313. Its totient is φ = 17064672.
The previous prime is 51236953. The next prime is 51236981. The reversal of 51236964 is 46963215.
It is a happy number.
The square root of 51236964 is 7158.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 26316900 + 24920064 = 5130^2 + 4992^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a Duffinian 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 8 ways as a sum of consecutive naturals, for example, 42352 + ... + 43544.
Almost surely, 251236964 is an apocalyptic number.
51236964 is the 7158-th square number.
It is an amenable number.
51236964 is an abundant number, since it is smaller than the sum of its proper divisors (78387349).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51236964 is a wasteful number, since it uses less digits than its factorization.
51236964 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2396 (or 1198 counting only the distinct ones).
The product of its digits is 38880, while the sum is 36.
The cubic root of 51236964 is about 371.4164454480.
Multiplying 51236964 by its sum of digits (36), we get a square (1844530704 = 429482).
51236964 divided by its sum of digits (36) gives a square (1423249 = 11932).
The spelling of 51236964 in words is "fifty-one million, two hundred thirty-six thousand, nine hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •