Search a number
-
+
645321203049647 is a prime number
BaseRepresentation
bin1001001010111010101000110…
…1000100101110010010101111
310010121220002211012010212022002
42102232222031010232102233
51134040420310440042042
610204252245033242515
7252632626665054665
oct22256521504562257
93117802735125262
10645321203049647
1117768a2046a58a3
12604636a526343b
13219106b3993467
14b54d9da1dcc35
154e91443475132
hex24aea8d12e4af

645321203049647 has 2 divisors, whose sum is σ = 645321203049648. Its totient is φ = 645321203049646.

The previous prime is 645321203049599. The next prime is 645321203049667. The reversal of 645321203049647 is 746940302123546.

It is a happy number.

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

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 645321203049647 - 26 = 645321203049583 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 645321203049592 and 645321203049601.

It is a congruent number.

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

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

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

Almost surely, 2645321203049647 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 26127360, while the sum is 56.

The spelling of 645321203049647 in words is "six hundred forty-five trillion, three hundred twenty-one billion, two hundred three million, forty-nine thousand, six hundred forty-seven".