Search a number
-
+
11010001381 is a prime number
BaseRepresentation
bin10100100000011111…
…10100100111100101
31001102022021000112221
422100033310213211
5140022030021011
65020302312341
7536560316251
oct122017644745
931368230487
1011010001381
11473a949aa5
1221732886b1
131066019a22
14766355261
154468b7971
hex2903f49e5

11010001381 has 2 divisors, whose sum is σ = 11010001382. Its totient is φ = 11010001380.

The previous prime is 11010001367. The next prime is 11010001417. The reversal of 11010001381 is 18310001011.

11010001381 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9329821281 + 1680180100 = 96591^2 + 40990^2 .

It is a cyclic number.

It is not a de Polignac number, because 11010001381 - 27 = 11010001253 is a prime.

It is a super-2 number, since 2×110100013812 (a number of 21 digits) contains 22 as substring.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (11010001361) 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, 5505000690 + 5505000691.

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

Almost surely, 211010001381 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 24, while the sum is 16.

Adding to 11010001381 its reverse (18310001011), we get a palindrome (29320002392).

The spelling of 11010001381 in words is "eleven billion, ten million, one thousand, three hundred eighty-one".