Search a number
-
+
1100514047 is a prime number
BaseRepresentation
bin100000110011000…
…1000001011111111
32211200210220110112
41001212020023333
54223212422142
6301111500235
736162133523
oct10146101377
92750726415
101100514047
11515236546
1226868767b
13147000959
14a6233d83
1566938382
hex419882ff

1100514047 has 2 divisors, whose sum is σ = 1100514048. Its totient is φ = 1100514046.

The previous prime is 1100513983. The next prime is 1100514053. The reversal of 1100514047 is 7404150011.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1100514047 - 26 = 1100513983 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 21100514047 is an apocalyptic number.

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

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

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

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

The square root of 1100514047 is about 33173.9965485017. The cubic root of 1100514047 is about 1032.4408905652.

Adding to 1100514047 its reverse (7404150011), we get a palindrome (8504664058).

It can be divided in two parts, 11005 and 14047, that added together give a palindrome (25052).

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