Base | Representation |
---|---|
bin | 101111100110111011… |
… | …011111110000110001 |
3 | 11212221120102002021202 |
4 | 233212323133300301 |
5 | 1314142430342104 |
6 | 35252253300545 |
7 | 3456530205206 |
oct | 574673376061 |
9 | 155846362252 |
10 | 51118996529 |
11 | 1a752382777 |
12 | 9aa7794755 |
13 | 4a88842153 |
14 | 268d1b5cad |
15 | 14e2c2e51e |
hex | be6edfc31 |
51118996529 has 8 divisors (see below), whose sum is σ = 51338669928. Its totient is φ = 50899726080.
The previous prime is 51118996501. The next prime is 51118996547. The reversal of 51118996529 is 92569981115.
It can be written as a sum of positive squares in 4 ways, for example, as 21298225 + 51097698304 = 4615^2 + 226048^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51118996529 is a prime.
It is a super-2 number, since 2×511189965292 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51118996129) 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 7 ways as a sum of consecutive naturals, for example, 154919 + ... + 355299.
It is an arithmetic number, because the mean of its divisors is an integer number (6417333741).
Almost surely, 251118996529 is an apocalyptic number.
It is an amenable number.
51118996529 is a deficient number, since it is larger than the sum of its proper divisors (219673399).
51118996529 is a wasteful number, since it uses less digits than its factorization.
51118996529 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201475.
The product of its digits is 1749600, while the sum is 56.
The spelling of 51118996529 in words is "fifty-one billion, one hundred eighteen million, nine hundred ninety-six thousand, five hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •