[go: up one dir, main page]

Search a number
-
+
1101103151 is a prime number
BaseRepresentation
bin100000110100001…
…1000000000101111
32211201220211120012
41001220120000233
54223340300101
6301132243435
736200136161
oct10150300057
92751824505
101101103151
115155a9105
1226891057b
13147178b35
14a6348931
1566a02bbb
hex41a1802f

1101103151 has 2 divisors, whose sum is σ = 1101103152. Its totient is φ = 1101103150.

The previous prime is 1101103121. The next prime is 1101103153. The reversal of 1101103151 is 1513011011.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 1101103151 - 210 = 1101102127 is a prime.

Together with 1101103153, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

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

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

Almost surely, 21101103151 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 15, while the sum is 14.

The square root of 1101103151 is about 33182.8743631410. The cubic root of 1101103151 is about 1032.6250792077.

Adding to 1101103151 its reverse (1513011011), we get a palindrome (2614114162).

The spelling of 1101103151 in words is "one billion, one hundred one million, one hundred three thousand, one hundred fifty-one".