Base | Representation |
---|---|
bin | 101111100111111000… |
… | …100010111111001101 |
3 | 11212222200112011122100 |
4 | 233213320202333031 |
5 | 1314211030004100 |
6 | 35254024305313 |
7 | 3460113222120 |
oct | 574770427715 |
9 | 155880464570 |
10 | 51135000525 |
11 | 1a760413814 |
12 | 9ab1012239 |
13 | 4a8bc5677b |
14 | 26913803b7 |
15 | 14e4341400 |
hex | be7e22fcd |
51135000525 has 72 divisors (see below), whose sum is σ = 106147027584. Its totient is φ = 23046710400.
The previous prime is 51135000509. The next prime is 51135000529. The reversal of 51135000525 is 52500053115.
51135000525 is a `hidden beast` number, since 5 + 1 + 135 + 0 + 0 + 0 + 525 = 666.
It is not a de Polignac number, because 51135000525 - 24 = 51135000509 is a prime.
It is a super-2 number, since 2×511350005252 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51135000529) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 116814 + ... + 340463.
It is an arithmetic number, because the mean of its divisors is an integer number (1474264272).
Almost surely, 251135000525 is an apocalyptic number.
It is an amenable number.
51135000525 is an abundant number, since it is smaller than the sum of its proper divisors (55012027059).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51135000525 is a wasteful number, since it uses less digits than its factorization.
51135000525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 457371 (or 457363 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 27.
The spelling of 51135000525 in words is "fifty-one billion, one hundred thirty-five million, five hundred twenty-five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •