Search a number
-
+
1511042240233 is a prime number
BaseRepresentation
bin10101111111010001001…
…000101100111011101001
312100110021010120001200001
4111333101020230323221
5144224103303141413
63114055131143001
7214112015056531
oct25772110547351
95313233501601
101511042240233
11532913a51969
12204a24ba4a61
13ac64c010376
14531c5db44c1
152948b9ce4dd
hex15fd122cee9

1511042240233 has 2 divisors, whose sum is σ = 1511042240234. Its totient is φ = 1511042240232.

The previous prime is 1511042240207. The next prime is 1511042240251. The reversal of 1511042240233 is 3320422401151.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 987614588944 + 523427651289 = 993788^2 + 723483^2 .

It is a cyclic number.

It is not a de Polignac number, because 1511042240233 - 213 = 1511042232041 is a prime.

It is a super-3 number, since 3×15110422402333 (a number of 38 digits) contains 333 as substring.

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

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

Almost surely, 21511042240233 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5760, while the sum is 28.

Adding to 1511042240233 its reverse (3320422401151), we get a palindrome (4831464641384).

The spelling of 1511042240233 in words is "one trillion, five hundred eleven billion, forty-two million, two hundred forty thousand, two hundred thirty-three".