Base | Representation |
---|---|
bin | 1001111001010110010111… |
… | …0011001101001010101101 |
3 | 1102112012101211212210200202 |
4 | 2132111211303031022231 |
5 | 2411233000140122421 |
6 | 35050333105403245 |
7 | 2202054566455166 |
oct | 236254563151255 |
9 | 42465354783622 |
10 | 10880860082861 |
11 | 351560194287a |
12 | 127894a039525 |
13 | 60c0a3498472 |
14 | 2988ca55876d |
15 | 13d081e9810b |
hex | 9e565ccd2ad |
10880860082861 has 2 divisors, whose sum is σ = 10880860082862. Its totient is φ = 10880860082860.
The previous prime is 10880860082837. The next prime is 10880860082951. The reversal of 10880860082861 is 16828006808801.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10811562152836 + 69297930025 = 3288094^2 + 263245^2 .
It is a cyclic number.
It is not a de Polignac number, because 10880860082861 - 214 = 10880860066477 is a prime.
It is a super-2 number, since 2×108808600828612 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10880860082797 and 10880860082806.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10880860072861) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5440430041430 + 5440430041431.
It is an arithmetic number, because the mean of its divisors is an integer number (5440430041431).
Almost surely, 210880860082861 is an apocalyptic number.
It is an amenable number.
10880860082861 is a deficient number, since it is larger than the sum of its proper divisors (1).
10880860082861 is an equidigital number, since it uses as much as digits as its factorization.
10880860082861 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2359296, while the sum is 56.
The spelling of 10880860082861 in words is "ten trillion, eight hundred eighty billion, eight hundred sixty million, eighty-two thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •