Base | Representation |
---|---|
bin | 1100010100110… |
… | …1000101010000 |
3 | 10121021102111220 |
4 | 3011031011100 |
5 | 101213232302 |
6 | 5044005040 |
7 | 1165260030 |
oct | 305150520 |
9 | 117242456 |
10 | 51695952 |
11 | 271a9a30 |
12 | 15390780 |
13 | a930329 |
14 | 6c198c0 |
15 | 48124bc |
hex | 314d150 |
51695952 has 160 divisors (see below), whose sum is σ = 169703424. Its totient is φ = 13171200.
The previous prime is 51695887. The next prime is 51695971. The reversal of 51695952 is 25959615.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 262318 + ... + 262514.
Almost surely, 251695952 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 51695952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (84851712).
51695952 is an abundant number, since it is smaller than the sum of its proper divisors (118007472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51695952 is a wasteful number, since it uses less digits than its factorization.
51695952 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 297 (or 291 counting only the distinct ones).
The product of its digits is 121500, while the sum is 42.
The square root of 51695952 is about 7189.9897079203. The cubic root of 51695952 is about 372.5222171935.
The spelling of 51695952 in words is "fifty-one million, six hundred ninety-five thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •