Search a number
-
+
1110301003057 is a prime number
BaseRepresentation
bin10000001010000011000…
…110001100110100110001
310221010212210012221102111
4100022003012030310301
5121142344024044212
62210022031445321
7143134202544301
oct20120306146461
93833783187374
101110301003057
1139896aa75064
1215b225686841
1380915c54c5c
143ba4b5c1601
151dd34eb9ea7
hex1028318cd31

1110301003057 has 2 divisors, whose sum is σ = 1110301003058. Its totient is φ = 1110301003056.

The previous prime is 1110301003003. The next prime is 1110301003079. The reversal of 1110301003057 is 7503001030111.

It is an a-pointer prime, because the next prime (1110301003079) can be obtained adding 1110301003057 to its sum of digits (22).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1094944588816 + 15356414241 = 1046396^2 + 123921^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1110301003057 - 231 = 1108153519409 is a prime.

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

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

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

Almost surely, 21110301003057 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 1110301003057 its reverse (7503001030111), we get a palindrome (8613302033168).

The spelling of 1110301003057 in words is "one trillion, one hundred ten billion, three hundred one million, three thousand, fifty-seven".