Search a number
-
+
1453663505513 is a prime number
BaseRepresentation
bin10101001001110101000…
…110001100110001101001
312010222011022100022220002
4111021311012030301221
5142304100324134023
63031445341512345
7210011064631622
oct25116506146151
95128138308802
101453663505513
1151054a17424a
121b5890b726b5
13a710666042b
14505016daa49
1527c2e45cb28
hex1527518cc69

1453663505513 has 2 divisors, whose sum is σ = 1453663505514. Its totient is φ = 1453663505512.

The previous prime is 1453663505479. The next prime is 1453663505519. The reversal of 1453663505513 is 3155053663541.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1280310354064 + 173353151449 = 1131508^2 + 416357^2 .

It is a cyclic number.

It is not a de Polignac number, because 1453663505513 - 236 = 1384944028777 is a prime.

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

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

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

Almost surely, 21453663505513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2430000, while the sum is 47.

The spelling of 1453663505513 in words is "one trillion, four hundred fifty-three billion, six hundred sixty-three million, five hundred five thousand, five hundred thirteen".