Search a number
-
+
1451304644369 is a prime number
BaseRepresentation
bin10101000111101000011…
…111110110111100010001
312010202001220201202201112
4111013220133312330101
5142234232442104434
63030415315143105
7206565452635466
oct25075037667421
95122056652645
101451304644369
1150a5496aaa28
121b5332ba4a95
13a6b1ba497c8
145035a30966d
1527b42310dce
hex151e87f6f11

1451304644369 has 2 divisors, whose sum is σ = 1451304644370. Its totient is φ = 1451304644368.

The previous prime is 1451304644329. The next prime is 1451304644389. The reversal of 1451304644369 is 9634464031541.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1217242204369 + 234062440000 = 1103287^2 + 483800^2 .

It is a cyclic number.

It is not a de Polignac number, because 1451304644369 - 236 = 1382585167633 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 21451304644369 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3732480, while the sum is 50.

The spelling of 1451304644369 in words is "one trillion, four hundred fifty-one billion, three hundred four million, six hundred forty-four thousand, three hundred sixty-nine".