Base | Representation |
---|---|
bin | 110000100111110000… |
… | …011010101100001011 |
3 | 11222202100221122011000 |
4 | 300213300122230023 |
5 | 1323404343024321 |
6 | 35552224510043 |
7 | 3525504605406 |
oct | 604760325413 |
9 | 158670848130 |
10 | 52206611211 |
11 | 201602a8787 |
12 | a14ba7b323 |
13 | 4bccc77631 |
14 | 275380cd3d |
15 | 155846a826 |
hex | c27c1ab0b |
52206611211 has 8 divisors (see below), whose sum is σ = 77343127760. Its totient is φ = 34804407456.
The previous prime is 52206611207. The next prime is 52206611243. The reversal of 52206611211 is 11211660225.
52206611211 is a `hidden beast` number, since 5 + 2 + 20 + 6 + 611 + 21 + 1 = 666.
It is not a de Polignac number, because 52206611211 - 22 = 52206611207 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 1933578193 = 52206611211 / (5 + 2 + 2 + 0 + 6 + 6 + 1 + 1 + 2 + 1 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (52206611291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 966789070 + ... + 966789123.
It is an arithmetic number, because the mean of its divisors is an integer number (9667890970).
Almost surely, 252206611211 is an apocalyptic number.
52206611211 is a deficient number, since it is larger than the sum of its proper divisors (25136516549).
52206611211 is a wasteful number, since it uses less digits than its factorization.
52206611211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1933578202 (or 1933578196 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 27.
The spelling of 52206611211 in words is "fifty-two billion, two hundred six million, six hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •