Search a number
-
+
1106701021561 is a prime number
BaseRepresentation
bin10000000110101100100…
…001010111000101111001
310220210120220012221012111
4100012230201113011321
5121113010430142221
62204224511412321
7142646040320362
oct20065441270571
93823526187174
101106701021561
11397392969743
1215a59bb240a1
13804911803a5
143b7c9438b69
151dbc3e0dbe1
hex101ac857179

1106701021561 has 2 divisors, whose sum is σ = 1106701021562. Its totient is φ = 1106701021560.

The previous prime is 1106701021541. The next prime is 1106701021661. The reversal of 1106701021561 is 1651201076011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 727668711225 + 379032310336 = 853035^2 + 615656^2 .

It is an emirp because it is prime and its reverse (1651201076011) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1106701021561 - 215 = 1106700988793 is a prime.

It is a super-2 number, since 2×11067010215612 (a number of 25 digits) contains 22 as substring.

It is not a weakly prime, because it can be changed into another prime (1106701021541) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 553350510780 + 553350510781.

It is an arithmetic number, because the mean of its divisors is an integer number (553350510781).

Almost surely, 21106701021561 is an apocalyptic number.

It is an amenable number.

1106701021561 is a deficient number, since it is larger than the sum of its proper divisors (1).

1106701021561 is an equidigital number, since it uses as much as digits as its factorization.

1106701021561 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 2520, while the sum is 31.

Adding to 1106701021561 its reverse (1651201076011), we get a palindrome (2757902097572).

The spelling of 1106701021561 in words is "one trillion, one hundred six billion, seven hundred one million, twenty-one thousand, five hundred sixty-one".