Base | Representation |
---|---|
bin | 1001101101110100011100… |
… | …1010100100010110001001 |
3 | 1101211021010010202222121221 |
4 | 2123131013022210112021 |
5 | 2400011312032232201 |
6 | 34415333355002041 |
7 | 2151543121342102 |
oct | 233350712442611 |
9 | 41737103688557 |
10 | 10682777617801 |
11 | 34495a4513aa3 |
12 | 1246488739321 |
13 | 5c64c650c263 |
14 | 28d098dc73a9 |
15 | 137d3c0474a1 |
hex | 9b7472a4589 |
10682777617801 has 2 divisors, whose sum is σ = 10682777617802. Its totient is φ = 10682777617800.
The previous prime is 10682777617769. The next prime is 10682777617807. The reversal of 10682777617801 is 10871677728601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10584871833600 + 97905784201 = 3253440^2 + 312899^2 .
It is a cyclic number.
It is not a de Polignac number, because 10682777617801 - 25 = 10682777617769 is a prime.
It is a super-2 number, since 2×106827776178012 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10682777617801.
It is not a weakly prime, because it can be changed into another prime (10682777617807) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5341388808900 + 5341388808901.
It is an arithmetic number, because the mean of its divisors is an integer number (5341388808901).
Almost surely, 210682777617801 is an apocalyptic number.
It is an amenable number.
10682777617801 is a deficient number, since it is larger than the sum of its proper divisors (1).
10682777617801 is an equidigital number, since it uses as much as digits as its factorization.
10682777617801 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11063808, while the sum is 61.
The spelling of 10682777617801 in words is "ten trillion, six hundred eighty-two billion, seven hundred seventy-seven million, six hundred seventeen thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •