Search a number
-
+
1514621011361 is a prime number
BaseRepresentation
bin10110000010100110011…
…100101000010110100001
312100210111112122110201212
4112002212130220112201
5144303420434330421
63115450212435505
7214266502113563
oct26024634502641
95323445573655
101514621011361
11534390090657
12205663618b95
13aca9c599913
14534453d9333
15295eac9ae5b
hex160a67285a1

1514621011361 has 2 divisors, whose sum is σ = 1514621011362. Its totient is φ = 1514621011360.

The previous prime is 1514621011303. The next prime is 1514621011369. The reversal of 1514621011361 is 1631101264151.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1093030521361 + 421590490000 = 1045481^2 + 649300^2 .

It is a cyclic number.

It is not a de Polignac number, because 1514621011361 - 210 = 1514621010337 is a prime.

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

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

Almost surely, 21514621011361 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4320, while the sum is 32.

The spelling of 1514621011361 in words is "one trillion, five hundred fourteen billion, six hundred twenty-one million, eleven thousand, three hundred sixty-one".