Base | Representation |
---|---|
bin | 1001100110101111101110… |
… | …1001111111001110001001 |
3 | 1101101122102210022210200011 |
4 | 2121223323221333032021 |
5 | 2341013420413423031 |
6 | 34243434432511521 |
7 | 2140011443162404 |
oct | 231537351771611 |
9 | 41348383283604 |
10 | 10561251701641 |
11 | 3402002288543 |
12 | 1226a119ab5a1 |
13 | 5b7bca15a724 |
14 | 28724b152d3b |
15 | 134ac81286b1 |
hex | 99afba7f389 |
10561251701641 has 2 divisors, whose sum is σ = 10561251701642. Its totient is φ = 10561251701640.
The previous prime is 10561251701629. The next prime is 10561251701647. The reversal of 10561251701641 is 14610715216501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7895228924025 + 2666022777616 = 2809845^2 + 1632796^2 .
It is a cyclic number.
It is not a de Polignac number, because 10561251701641 - 213 = 10561251693449 is a prime.
It is a super-2 number, since 2×105612517016412 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10561251701594 and 10561251701603.
It is not a weakly prime, because it can be changed into another prime (10561251701647) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5280625850820 + 5280625850821.
It is an arithmetic number, because the mean of its divisors is an integer number (5280625850821).
Almost surely, 210561251701641 is an apocalyptic number.
It is an amenable number.
10561251701641 is a deficient number, since it is larger than the sum of its proper divisors (1).
10561251701641 is an equidigital number, since it uses as much as digits as its factorization.
10561251701641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 50400, while the sum is 40.
The spelling of 10561251701641 in words is "ten trillion, five hundred sixty-one billion, two hundred fifty-one million, seven hundred one thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •