Search a number
-
+
1101513047 is a prime number
BaseRepresentation
bin100000110100111…
…1100000101010111
32211202200122211112
41001221330011113
54223441404142
6301145125235
736203464205
oct10151740527
92752618745
101101513047
11515859068
12268a8981b
1314729058b
14a6414075
1566a84382
hex41a7c157

1101513047 has 2 divisors, whose sum is σ = 1101513048. Its totient is φ = 1101513046.

The previous prime is 1101513019. The next prime is 1101513073. The reversal of 1101513047 is 7403151011.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1101513047 - 28 = 1101512791 is a prime.

It is a super-2 number, since 2×11015130472 = 2426661985422448418, which contains 22 as substring.

It is a congruent number.

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

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

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

Almost surely, 21101513047 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 420, while the sum is 23.

The square root of 1101513047 is about 33189.0501069253. The cubic root of 1101513047 is about 1032.7531981092.

Adding to 1101513047 its reverse (7403151011), we get a palindrome (8504664058).

The spelling of 1101513047 in words is "one billion, one hundred one million, five hundred thirteen thousand, forty-seven".