Search a number
-
+
1030132031053 is a prime number
BaseRepresentation
bin11101111110110001010…
…01110101111001001101
310122110221200011012102011
432333120221311321031
5113334202244443203
62105123000301221
7134265426535036
oct16773051657115
93573850135364
101030132031053
113679707488a4
12147791171811
13761aab0aa08
1437c0421da8d
151bbe1c7076d
hexefd8a75e4d

1030132031053 has 2 divisors, whose sum is σ = 1030132031054. Its totient is φ = 1030132031052.

The previous prime is 1030132030969. The next prime is 1030132031087. The reversal of 1030132031053 is 3501302310301.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 939664625769 + 90467405284 = 969363^2 + 300778^2 .

It is an emirp because it is prime and its reverse (3501302310301) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1030132031053 - 237 = 892693077581 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 21030132031053 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 810, while the sum is 22.

Adding to 1030132031053 its reverse (3501302310301), we get a palindrome (4531434341354).

The spelling of 1030132031053 in words is "one trillion, thirty billion, one hundred thirty-two million, thirty-one thousand, fifty-three".