Base | Representation |
---|---|
bin | 1100010010011… |
… | …0010010111101 |
3 | 10120222100120221 |
4 | 3010212102331 |
5 | 101143141320 |
6 | 5040341341 |
7 | 1164025615 |
oct | 304462275 |
9 | 116870527 |
10 | 51537085 |
11 | 27100636 |
12 | 15314851 |
13 | a8a5c22 |
14 | 6bb7a45 |
15 | 47d03aa |
hex | 31264bd |
51537085 has 8 divisors (see below), whose sum is σ = 62423136. Its totient is φ = 40843920.
The previous prime is 51537067. The next prime is 51537113. The reversal of 51537085 is 58073515.
51537085 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 51537085 - 211 = 51535037 is a prime.
It is a super-2 number, since 2×515370852 = 5312142260594450, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 51537085.
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 7 ways as a sum of consecutive naturals, for example, 47631 + ... + 48700.
It is an arithmetic number, because the mean of its divisors is an integer number (7802892).
Almost surely, 251537085 is an apocalyptic number.
It is an amenable number.
51537085 is a deficient number, since it is larger than the sum of its proper divisors (10886051).
51537085 is a wasteful number, since it uses less digits than its factorization.
51537085 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96443.
The product of its (nonzero) digits is 21000, while the sum is 34.
The square root of 51537085 is about 7178.9334166017. The cubic root of 51537085 is about 372.1402258763.
The spelling of 51537085 in words is "fifty-one million, five hundred thirty-seven thousand, eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •