Search a number
-
+
1101482591537 is a prime number
BaseRepresentation
bin10000000001110101011…
…110101000010100110001
310220022010012211012222102
4100001311132220110301
5121021314020412122
62202003014350145
7142402523355566
oct20016536502461
93808105735872
101101482591537
11395155230a59
1215958435b355
137cb3bcb3883
143b45235886d
151d9bac0c492
hex100757a8531

1101482591537 has 2 divisors, whose sum is σ = 1101482591538. Its totient is φ = 1101482591536.

The previous prime is 1101482591471. The next prime is 1101482591567. The reversal of 1101482591537 is 7351952841011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1096060331041 + 5422260496 = 1046929^2 + 73636^2 .

It is a cyclic number.

It is not a de Polignac number, because 1101482591537 - 222 = 1101478397233 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 1101482591491 and 1101482591500.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 21101482591537 is an apocalyptic number.

It is an amenable number.

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

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

1101482591537 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 302400, while the sum is 47.

The spelling of 1101482591537 in words is "one trillion, one hundred one billion, four hundred eighty-two million, five hundred ninety-one thousand, five hundred thirty-seven".