Base | Representation |
---|---|
bin | 1010101100100111010001… |
… | …0100001000001110010100 |
3 | 1112122101200011112011121020 |
4 | 2223021310110020032110 |
5 | 3020200144400440233 |
6 | 41003105212121140 |
7 | 2322513500350410 |
oct | 253116424101624 |
9 | 45571604464536 |
10 | 11761571890068 |
11 | 3825066787970 |
12 | 139b57a7661b0 |
13 | 67415ab91330 |
14 | 2c9397dc7d40 |
15 | 155e2aeae9b3 |
hex | ab274508394 |
11761571890068 has 1536 divisors, whose sum is σ = 41201801625600. Its totient is φ = 2510734786560.
The previous prime is 11761571890039. The next prime is 11761571890091. The reversal of 11761571890068 is 86009817516711.
It is a junction number, because it is equal to n+sod(n) for n = 11761571889993 and 11761571890020.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 511 ways as a sum of consecutive naturals, for example, 59103376233 + ... + 59103376431.
It is an arithmetic number, because the mean of its divisors is an integer number (26824089600).
Almost surely, 211761571890068 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11761571890068, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20600900812800).
11761571890068 is an abundant number, since it is smaller than the sum of its proper divisors (29440229735532).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11761571890068 is a wasteful number, since it uses less digits than its factorization.
11761571890068 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 477 (or 475 counting only the distinct ones).
The product of its (nonzero) digits is 5080320, while the sum is 60.
The spelling of 11761571890068 in words is "eleven trillion, seven hundred sixty-one billion, five hundred seventy-one million, eight hundred ninety thousand, sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •