Base | Representation |
---|---|
bin | 110001000010111100… |
… | …011111111000101010 |
3 | 12000221011021112211120 |
4 | 301002330133320222 |
5 | 1330323131404200 |
6 | 40105401440110 |
7 | 3543014046222 |
oct | 610274377052 |
9 | 160834245746 |
10 | 52662763050 |
11 | 20374836377 |
12 | a2587a0036 |
13 | 4c73619471 |
14 | 279822d082 |
15 | 15835219a0 |
hex | c42f1fe2a |
52662763050 has 48 divisors (see below), whose sum is σ = 136282080960. Its totient is φ = 13432819840.
The previous prime is 52662763039. The next prime is 52662763057. The reversal of 52662763050 is 5036726625.
It is a super-2 number, since 2×526627630502 (a number of 22 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 52662762993 and 52662763011.
It is not an unprimeable number, because it can be changed into a prime (52662763057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7628835 + ... + 7635734.
It is an arithmetic number, because the mean of its divisors is an integer number (2839210020).
Almost surely, 252662763050 is an apocalyptic number.
52662763050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
52662763050 is an abundant number, since it is smaller than the sum of its proper divisors (83619317910).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52662763050 is a wasteful number, since it uses less digits than its factorization.
52662763050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15264607 (or 15264602 counting only the distinct ones).
The product of its (nonzero) digits is 453600, while the sum is 42.
The spelling of 52662763050 in words is "fifty-two billion, six hundred sixty-two million, seven hundred sixty-three thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.266 sec. • engine limits •