Search a number
-
+
1302010111933 is a prime number
BaseRepresentation
bin10010111100100101110…
…110011010011110111101
311121110201022201201102021
4102330211312122132331
5132313004042040213
62434045111200141
7163032011230126
oct22744566323675
94543638651367
101302010111933
114621a7846023
12190408676051
1395a186a229b
144703651704d
1523d05633d8d
hex12f25d9a7bd

1302010111933 has 2 divisors, whose sum is σ = 1302010111934. Its totient is φ = 1302010111932.

The previous prime is 1302010111907. The next prime is 1302010111937. The reversal of 1302010111933 is 3391110102031.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1264336078329 + 37674033604 = 1124427^2 + 194098^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1302010111933 - 217 = 1302009980861 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 21302010111933 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 486, while the sum is 25.

Adding to 1302010111933 its reverse (3391110102031), we get a palindrome (4693120213964).

The spelling of 1302010111933 in words is "one trillion, three hundred two billion, ten million, one hundred eleven thousand, nine hundred thirty-three".