Search a number
-
+
1453631111041 is a prime number
BaseRepresentation
bin10101001001110011001…
…010100111111110000001
312010222002001101112000211
4111021303022213332001
5142304014031023131
63031442223314121
7210010222401244
oct25116312477601
95128061345024
101453631111041
1151053295885a
121b588214b941
13a70cca2a5c5
14504db2a725b
1527c2b6ae5b1
hex152732a7f81

1453631111041 has 2 divisors, whose sum is σ = 1453631111042. Its totient is φ = 1453631111040.

The previous prime is 1453631111033. The next prime is 1453631111057. The reversal of 1453631111041 is 1401111363541.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1241475066225 + 212156044816 = 1114215^2 + 460604^2 .

It is a cyclic number.

It is not a de Polignac number, because 1453631111041 - 23 = 1453631111033 is a prime.

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

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

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

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

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

Almost surely, 21453631111041 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4320, while the sum is 31.

Adding to 1453631111041 its reverse (1401111363541), we get a palindrome (2854742474582).

The spelling of 1453631111041 in words is "one trillion, four hundred fifty-three billion, six hundred thirty-one million, one hundred eleven thousand, forty-one".