Base | Representation |
---|---|
bin | 110000101100001010… |
… | …101111010000011000 |
3 | 11222221112012200012100 |
4 | 300230022233100120 |
5 | 1324032314320211 |
6 | 40003431043400 |
7 | 3530363636550 |
oct | 605412572030 |
9 | 158845180170 |
10 | 52280620056 |
11 | 20199057715 |
12 | a170810560 |
13 | 4c123baa52 |
14 | 275d596160 |
15 | 155ebd9156 |
hex | c2c2af418 |
52280620056 has 96 divisors (see below), whose sum is σ = 161907782400. Its totient is φ = 14929306560.
The previous prime is 52280619997. The next prime is 52280620057. The reversal of 52280620056 is 65002608225.
52280620056 is a `hidden beast` number, since 5 + 2 + 28 + 0 + 620 + 0 + 5 + 6 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 52280620056.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52280620057) 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, 946365 + ... + 1000083.
It is an arithmetic number, because the mean of its divisors is an integer number (1686539400).
Almost surely, 252280620056 is an apocalyptic number.
52280620056 is a gapful number since it is divisible by the number (56) formed by its first and last digit.
It is an amenable number.
52280620056 is an abundant number, since it is smaller than the sum of its proper divisors (109627162344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52280620056 is a wasteful number, since it uses less digits than its factorization.
52280620056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55669 (or 55662 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 36.
The spelling of 52280620056 in words is "fifty-two billion, two hundred eighty million, six hundred twenty thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •