Base | Representation |
---|---|
bin | 11001111100011011101111… |
… | …10001010100101001100111 |
3 | 21111000010100011012211010210 |
4 | 30332031313301110221213 |
5 | 24434220104330323421 |
6 | 321201204325350503 |
7 | 15005606142450354 |
oct | 1476156761245147 |
9 | 244003304184123 |
10 | 57052060011111 |
11 | 171a6708594300 |
12 | 64950a3568433 |
13 | 25aaca88176b9 |
14 | 10134979ab62b |
15 | 68e0c59bc576 |
hex | 33e377c54a67 |
57052060011111 has 48 divisors (see below), whose sum is σ = 83660762304000. Its totient is φ = 34557463543680.
The previous prime is 57052060011103. The next prime is 57052060011113. The reversal of 57052060011111 is 11111006025075.
It is not a de Polignac number, because 57052060011111 - 23 = 57052060011103 is a prime.
It is a super-2 number, since 2×570520600111112 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (57052060011113) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 8269609540 + ... + 8269616438.
It is an arithmetic number, because the mean of its divisors is an integer number (1742932548000).
Almost surely, 257052060011111 is an apocalyptic number.
57052060011111 is a deficient number, since it is larger than the sum of its proper divisors (26608702292889).
57052060011111 is a wasteful number, since it uses less digits than its factorization.
57052060011111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16500 (or 16489 counting only the distinct ones).
The product of its (nonzero) digits is 2100, while the sum is 30.
Adding to 57052060011111 its reverse (11111006025075), we get a palindrome (68163066036186).
The spelling of 57052060011111 in words is "fifty-seven trillion, fifty-two billion, sixty million, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •