Base | Representation |
---|---|
bin | 1001100110101011010001… |
… | …0100111110001100110101 |
3 | 1101101112100101112120111021 |
4 | 2121222310110332030311 |
5 | 2341003443040310401 |
6 | 34243120003341141 |
7 | 2136640002363652 |
oct | 231526424761465 |
9 | 41345311476437 |
10 | 10560055010101 |
11 | 3401548831473 |
12 | 12267390817b1 |
13 | 5b7a6925411c |
14 | 287176244c29 |
15 | 134a580432a1 |
hex | 99ab453e335 |
10560055010101 has 2 divisors, whose sum is σ = 10560055010102. Its totient is φ = 10560055010100.
The previous prime is 10560055010033. The next prime is 10560055010111. The reversal of 10560055010101 is 10101055006501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6074258089201 + 4485796920900 = 2464601^2 + 2117970^2 .
It is a cyclic number.
It is not a de Polignac number, because 10560055010101 - 229 = 10559518139189 is a prime.
It is a super-2 number, since 2×105600550101012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10560055010111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5280027505050 + 5280027505051.
It is an arithmetic number, because the mean of its divisors is an integer number (5280027505051).
Almost surely, 210560055010101 is an apocalyptic number.
It is an amenable number.
10560055010101 is a deficient number, since it is larger than the sum of its proper divisors (1).
10560055010101 is an equidigital number, since it uses as much as digits as its factorization.
10560055010101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 750, while the sum is 25.
The spelling of 10560055010101 in words is "ten trillion, five hundred sixty billion, fifty-five million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •