Search a number
-
+
6263427064001 is a prime number
BaseRepresentation
bin101101100100101000101…
…0110000110000011000001
3211011210000000000221011012
41123021101112012003001
51310104444312022001
621153213443130305
71214342363420132
oct133112126060301
924153000027135
106263427064001
111aa5339321608
12851a89073995
1336583c119773
14179219977c89
15acdd59612bb
hex5b2515860c1

6263427064001 has 2 divisors, whose sum is σ = 6263427064002. Its totient is φ = 6263427064000.

The previous prime is 6263427063983. The next prime is 6263427064003. The reversal of 6263427064001 is 1004607243626.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5985778162225 + 277648901776 = 2446585^2 + 526924^2 .

It is a cyclic number.

It is not a de Polignac number, because 6263427064001 - 26 = 6263427063937 is a prime.

Together with 6263427064003, it forms a pair of twin primes.

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 6263427064001.

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

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

Almost surely, 26263427064001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 290304, while the sum is 41.

The spelling of 6263427064001 in words is "six trillion, two hundred sixty-three billion, four hundred twenty-seven million, sixty-four thousand, one".