Search a number
-
+
1452992075113 is a prime number
BaseRepresentation
bin10101001001001101000…
…100111001010101101001
312010220102111221010112111
4111021031010321111221
5142301211432400423
63031254554442321
7206655332600605
oct25111504712551
95126374833474
101452992075113
11510235168697
121b57241333a1
13a702a514c37
145047a47c505
1527be053060d
hex1524d139569

1452992075113 has 2 divisors, whose sum is σ = 1452992075114. Its totient is φ = 1452992075112.

The previous prime is 1452992074991. The next prime is 1452992075123. The reversal of 1452992075113 is 3115702992541.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1099838807824 + 353153267289 = 1048732^2 + 594267^2 .

It is a cyclic number.

It is not a de Polignac number, because 1452992075113 - 29 = 1452992074601 is a prime.

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

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

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

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

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

Almost surely, 21452992075113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 680400, while the sum is 49.

The spelling of 1452992075113 in words is "one trillion, four hundred fifty-two billion, nine hundred ninety-two million, seventy-five thousand, one hundred thirteen".