Search a number
-
+
11451145151401 is a prime number
BaseRepresentation
bin1010011010100010110101…
…1100000110001110101001
31111112201101222211221022221
42212220231130012032221
53000103421124321101
640204330005514041
72261214023535034
oct246505534061651
944481358757287
1011451145151401
1137154489a857a
12134b385412921
13650ab8b31297
142b834a19c01b
1514cd0d24baa1
hexa6a2d7063a9

11451145151401 has 2 divisors, whose sum is σ = 11451145151402. Its totient is φ = 11451145151400.

The previous prime is 11451145151393. The next prime is 11451145151507. The reversal of 11451145151401 is 10415154115411.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 7813428153001 + 3637716998400 = 2795251^2 + 1907280^2 .

It is a cyclic number.

It is not a de Polignac number, because 11451145151401 - 23 = 11451145151393 is a prime.

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

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

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

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

Almost surely, 211451145151401 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 8000, while the sum is 34.

Adding to 11451145151401 its reverse (10415154115411), we get a palindrome (21866299266812).

The spelling of 11451145151401 in words is "eleven trillion, four hundred fifty-one billion, one hundred forty-five million, one hundred fifty-one thousand, four hundred one".