Base | Representation |
---|---|
bin | 1001100110101111010011… |
… | …1011011101111011010111 |
3 | 1101101122010220222000012111 |
4 | 2121223310323131323113 |
5 | 2341013203020441401 |
6 | 34243415321531451 |
7 | 2140005602664445 |
oct | 231536473357327 |
9 | 41348126860174 |
10 | 10561138843351 |
11 | 3401a54604428 |
12 | 12269a0043b87 |
13 | 5b7bac964385 |
14 | 28723a175b95 |
15 | 134abd283e51 |
hex | 99af4edded7 |
10561138843351 has 2 divisors, whose sum is σ = 10561138843352. Its totient is φ = 10561138843350.
The previous prime is 10561138843313. The next prime is 10561138843403. The reversal of 10561138843351 is 15334883116501.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10561138843351 - 225 = 10561105288919 is a prime.
It is a super-2 number, since 2×105611388433512 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10561138843295 and 10561138843304.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10561138843051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5280569421675 + 5280569421676.
It is an arithmetic number, because the mean of its divisors is an integer number (5280569421676).
Almost surely, 210561138843351 is an apocalyptic number.
10561138843351 is a deficient number, since it is larger than the sum of its proper divisors (1).
10561138843351 is an equidigital number, since it uses as much as digits as its factorization.
10561138843351 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1036800, while the sum is 49.
The spelling of 10561138843351 in words is "ten trillion, five hundred sixty-one billion, one hundred thirty-eight million, eight hundred forty-three thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •