Search a number
-
+
140451045311513 is a prime number
BaseRepresentation
bin11111111011110101001110…
…101010100000010000011001
3200102021222200211120102001002
4133323311032222200100121
5121402122220044432023
61214414153001234345
741404152556133216
oct3773651652402031
9612258624512032
10140451045311513
114082aa54588702
121390442aa929b5
13604a627531c81
142697c1c964b0d
1511386c240bb28
hex7fbd4eaa0419

140451045311513 has 2 divisors, whose sum is σ = 140451045311514. Its totient is φ = 140451045311512.

The previous prime is 140451045311509. The next prime is 140451045311519. The reversal of 140451045311513 is 315113540154041.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 112844984613904 + 27606060697609 = 10622852^2 + 5254147^2 .

It is a cyclic number.

It is not a de Polignac number, because 140451045311513 - 22 = 140451045311509 is a prime.

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

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

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

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

Almost surely, 2140451045311513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 72000, while the sum is 38.

Adding to 140451045311513 its reverse (315113540154041), we get a palindrome (455564585465554).

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