Base | Representation |
---|---|
bin | 10111010100100010001011… |
… | …10111001000111111011000 |
3 | 20201120121121010112210100100 |
4 | 23222101011313020333120 |
5 | 23210210222342100023 |
6 | 301023042240535400 |
7 | 13542036366145221 |
oct | 1352210567107730 |
9 | 221517533483310 |
10 | 51283081596888 |
11 | 1538203a683649 |
12 | 5903008321560 |
13 | 227cc876c61ab |
14 | c94185c74248 |
15 | 5ddecd629c43 |
hex | 2ea445dc8fd8 |
51283081596888 has 48 divisors (see below), whose sum is σ = 138903186001320. Its totient is φ = 17092944326016.
The previous prime is 51283081596881. The next prime is 51283081596917. The reversal of 51283081596888 is 88869518038215.
51283081596888 is a `hidden beast` number, since 5 + 1 + 28 + 3 + 0 + 8 + 1 + 596 + 8 + 8 + 8 = 666.
It is a Smith number, since the sum of its digits (72) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (72).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51283081596881) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 28629006 + ... + 30367517.
Almost surely, 251283081596888 is an apocalyptic number.
It is an amenable number.
51283081596888 is an abundant number, since it is smaller than the sum of its proper divisors (87620104404432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51283081596888 is a wasteful number, since it uses less digits than its factorization.
51283081596888 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 59008608 (or 59008601 counting only the distinct ones).
The product of its (nonzero) digits is 265420800, while the sum is 72.
The spelling of 51283081596888 in words is "fifty-one trillion, two hundred eighty-three billion, eighty-one million, five hundred ninety-six thousand, eight hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •