Search a number
-
+
1013120021113 is a prime number
BaseRepresentation
bin11101011111000101010…
…10001011001001111001
310120212001002001112221221
432233202222023021321
5113044332211133423
62053230530032041
7133124026043314
oct16574252131171
93525032045857
101013120021113
11360730926a52
12144423a18621
13746c94a0c45
143706cad597b
151b5484c4e5d
hexebe2a8b279

1013120021113 has 2 divisors, whose sum is σ = 1013120021114. Its totient is φ = 1013120021112.

The previous prime is 1013120021099. The next prime is 1013120021131. The reversal of 1013120021113 is 3111200213101.

It is a happy number.

Together with next prime (1013120021131) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 831957421689 + 181162599424 = 912117^2 + 425632^2 .

It is a cyclic number.

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

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

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

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

Almost surely, 21013120021113 is an apocalyptic number.

It is an amenable number.

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

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

1013120021113 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 36, while the sum is 16.

Adding to 1013120021113 its reverse (3111200213101), we get a palindrome (4124320234214).

The spelling of 1013120021113 in words is "one trillion, thirteen billion, one hundred twenty million, twenty-one thousand, one hundred thirteen".