Search a number
-
+
1363036627457 is a prime number
BaseRepresentation
bin10011110101011011010…
…100000110001000000001
311211022020100212220201222
4103311123110012020001
5134312444334034312
62522100445204425
7200322214112351
oct23653324061001
94738210786658
101363036627457
1148607370741a
121a01ba260715
139b6c29c15bb
1449d8545ab61
15256c8054672
hex13d5b506201

1363036627457 has 2 divisors, whose sum is σ = 1363036627458. Its totient is φ = 1363036627456.

The previous prime is 1363036627409. The next prime is 1363036627483. The reversal of 1363036627457 is 7547266303631.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 919535237776 + 443501389681 = 958924^2 + 665959^2 .

It is a cyclic number.

It is not a de Polignac number, because 1363036627457 - 232 = 1358741660161 is a prime.

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

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

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

Almost surely, 21363036627457 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 11430720, while the sum is 53.

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