Base | Representation |
---|---|
bin | 11000000000000110111000… |
… | …10111011110101000011110 |
3 | 20220212202001201221221001211 |
4 | 30000003130113132220132 |
5 | 23404222430322304200 |
6 | 304130525312455034 |
7 | 14055150633350665 |
oct | 1400033427365036 |
9 | 226782051857054 |
10 | 52780255275550 |
11 | 158a9a87140980 |
12 | 5b0520084a47a |
13 | 235b2063c7aba |
14 | d06813dc7ddc |
15 | 617e077daaba |
hex | 3000dc5dea1e |
52780255275550 has 48 divisors (see below), whose sum is σ = 107201658846672. Its totient is φ = 19173873382400.
The previous prime is 52780255275547. The next prime is 52780255275557. The reversal of 52780255275550 is 5557255208725.
It is a hoax number, since the sum of its digits (58) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52780255275557) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 46809139 + ... + 47923438.
It is an arithmetic number, because the mean of its divisors is an integer number (2233367892639).
Almost surely, 252780255275550 is an apocalyptic number.
52780255275550 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
52780255275550 is an abundant number, since it is smaller than the sum of its proper divisors (54421403571122).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52780255275550 is a wasteful number, since it uses less digits than its factorization.
52780255275550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94733613 (or 94733608 counting only the distinct ones).
The product of its (nonzero) digits is 49000000, while the sum is 58.
The spelling of 52780255275550 in words is "fifty-two trillion, seven hundred eighty billion, two hundred fifty-five million, two hundred seventy-five thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •