Base | Representation |
---|---|
bin | 101111100100111100… |
… | …011000100010100101 |
3 | 11212212020201011021111 |
4 | 233210330120202211 |
5 | 1314110413042121 |
6 | 35245103145021 |
7 | 3455644033000 |
oct | 574474304245 |
9 | 155766634244 |
10 | 51085674661 |
11 | 1a73559353a |
12 | 9a985a5171 |
13 | 4a81976178 |
14 | 26889c0537 |
15 | 14ded4b2e1 |
hex | be4f188a5 |
51085674661 has 32 divisors (see below), whose sum is σ = 63096704000. Its totient is φ = 41227749360.
The previous prime is 51085674649. The next prime is 51085674743. The reversal of 51085674661 is 16647658015.
51085674661 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 51085674661 - 233 = 42495740069 is a prime.
It is a hoax number, since the sum of its digits (49) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (49).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51085674631) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1038226 + ... + 1086316.
It is an arithmetic number, because the mean of its divisors is an integer number (1971772000).
Almost surely, 251085674661 is an apocalyptic number.
It is an amenable number.
51085674661 is a deficient number, since it is larger than the sum of its proper divisors (12011029339).
51085674661 is a wasteful number, since it uses less digits than its factorization.
51085674661 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48294 (or 48280 counting only the distinct ones).
The product of its (nonzero) digits is 1209600, while the sum is 49.
The spelling of 51085674661 in words is "fifty-one billion, eighty-five million, six hundred seventy-four thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •