Base | Representation |
---|---|
bin | 101111100111111100… |
… | …011111100100111101 |
3 | 11212222202110201212011 |
4 | 233213330133210331 |
5 | 1314211311111013 |
6 | 35254102411221 |
7 | 3460125061351 |
oct | 574774374475 |
9 | 155882421764 |
10 | 51136035133 |
11 | 1a760a60067 |
12 | 9ab1430b11 |
13 | 4a8c229671 |
14 | 269156d461 |
15 | 14e4497c3d |
hex | be7f1f93d |
51136035133 has 8 divisors (see below), whose sum is σ = 51609958400. Its totient is φ = 50662199088.
The previous prime is 51136035131. The next prime is 51136035143. The reversal of 51136035133 is 33153063115.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 51136035133 - 21 = 51136035131 is a prime.
It is a super-2 number, since 2×511360351332 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 51136035095 and 51136035104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51136035131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2141860 + ... + 2165602.
It is an arithmetic number, because the mean of its divisors is an integer number (6451244800).
Almost surely, 251136035133 is an apocalyptic number.
It is an amenable number.
51136035133 is a deficient number, since it is larger than the sum of its proper divisors (473923267).
51136035133 is a wasteful number, since it uses less digits than its factorization.
51136035133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43611.
The product of its (nonzero) digits is 12150, while the sum is 31.
Adding to 51136035133 its reverse (33153063115), we get a palindrome (84289098248).
The spelling of 51136035133 in words is "fifty-one billion, one hundred thirty-six million, thirty-five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •