Search a number
-
+
463151152010513 is a prime number
BaseRepresentation
bin110100101001110111100011…
…1111001001001010100010001
32020201212211002010002121202202
41221103233013321021110101
5441201232024403314023
64321012411341052545
7166361365210132511
oct15123570771112421
92221784063077682
10463151152010513
11124635333a9112a
1243b41967857155
1316b57c73a697c5
1482528c7625841
153882957211128
hex1a53bc7e49511

463151152010513 has 2 divisors, whose sum is σ = 463151152010514. Its totient is φ = 463151152010512.

The previous prime is 463151152010497. The next prime is 463151152010551. The reversal of 463151152010513 is 315010251151364.

It is an a-pointer prime, because the next prime (463151152010551) can be obtained adding 463151152010513 to its sum of digits (38).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 462656525340304 + 494626670209 = 21509452^2 + 703297^2 .

It is a cyclic number.

It is not a de Polignac number, because 463151152010513 - 24 = 463151152010497 is a prime.

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

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

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

Almost surely, 2463151152010513 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 463151152010513 in words is "four hundred sixty-three trillion, one hundred fifty-one billion, one hundred fifty-two million, ten thousand, five hundred thirteen".