Search a number
-
+
1101055829 is a prime number
BaseRepresentation
bin100000110100000…
…1100011101010101
32211201211102122112
41001220030131111
54223332241304
6301131240405
736166551206
oct10150143525
92751742575
101101055829
115155765a5
122688a9105
13147160433
14a63355ad
15669e3b6e
hex41a0c755

1101055829 has 2 divisors, whose sum is σ = 1101055830. Its totient is φ = 1101055828.

The previous prime is 1101055811. The next prime is 1101055849. The reversal of 1101055829 is 9285501011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 869955025 + 231100804 = 29495^2 + 15202^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1101055829 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 21101055829 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3600, while the sum is 32.

The square root of 1101055829 is about 33182.1613069432. The cubic root of 1101055829 is about 1032.6102859875.

The spelling of 1101055829 in words is "one billion, one hundred one million, fifty-five thousand, eight hundred twenty-nine".