Search a number
-
+
1015114153033 is a prime number
BaseRepresentation
bin11101100010110011000…
…01001011110001001001
310121001012001100221200201
432301121201023301021
5113112423210344113
62054200443132201
7133224321635101
oct16613141136111
93531161327621
101015114153033
11361564525862
1214489b814061
1374956672366
14371bb8a4201
151b6135c8cdd
hexec5984bc49

1015114153033 has 2 divisors, whose sum is σ = 1015114153034. Its totient is φ = 1015114153032.

The previous prime is 1015114152967. The next prime is 1015114153049. The reversal of 1015114153033 is 3303514115101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 946908040464 + 68206112569 = 973092^2 + 261163^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1015114153033 is a prime.

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

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

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

Almost surely, 21015114153033 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 1015114153033 its reverse (3303514115101), we get a palindrome (4318628268134).

The spelling of 1015114153033 in words is "one trillion, fifteen billion, one hundred fourteen million, one hundred fifty-three thousand, thirty-three".