Base | Representation |
---|---|
bin | 10111001111100000000110… |
… | …01001001010101011100000 |
3 | 20200222002021011202020010220 |
4 | 23213300003021022223200 |
5 | 23144342103332311323 |
6 | 300411403543123040 |
7 | 13523405333103336 |
oct | 1347600311125340 |
9 | 220862234666126 |
10 | 51110163557088 |
11 | 15315775985a39 |
12 | 58955aa443480 |
13 | 226988b05324c |
14 | c89a6084bb56 |
15 | 5d975ca2a0e3 |
hex | 2e7c0324aae0 |
51110163557088 has 96 divisors (see below), whose sum is σ = 137289663891072. Its totient is φ = 16639865356800.
The previous prime is 51110163557077. The next prime is 51110163557093. The reversal of 51110163557088 is 88075536101115.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (96).
It is a super-2 number, since 2×511101635570882 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 51110163557088.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 111148123 + ... + 111607013.
It is an arithmetic number, because the mean of its divisors is an integer number (1430100665532).
Almost surely, 251110163557088 is an apocalyptic number.
It is an amenable number.
51110163557088 is an abundant number, since it is smaller than the sum of its proper divisors (86179500333984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51110163557088 is a wasteful number, since it uses less digits than its factorization.
51110163557088 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 485928 (or 485920 counting only the distinct ones).
The product of its (nonzero) digits is 1008000, while the sum is 51.
The spelling of 51110163557088 in words is "fifty-one trillion, one hundred ten billion, one hundred sixty-three million, five hundred fifty-seven thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •