Search a number
-
+
1114013514961 is a prime number
BaseRepresentation
bin10000001101100000011…
…000010011110011010001
310221111110111222002100101
4100031200120103303101
5121222444424434321
62211434251452401
7143325202432204
oct20154030236321
93844414862311
101114013514961
1139a4a5650216
1215baa0a57101
1381088139869
143bcc069b93b
151dea0da3791
hex10360613cd1

1114013514961 has 2 divisors, whose sum is σ = 1114013514962. Its totient is φ = 1114013514960.

The previous prime is 1114013514923. The next prime is 1114013515001. The reversal of 1114013514961 is 1694153104111.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1085128473025 + 28885041936 = 1041695^2 + 169956^2 .

It is a cyclic number.

It is not a de Polignac number, because 1114013514961 - 233 = 1105423580369 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 1114013514961.

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

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

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

Almost surely, 21114013514961 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12960, while the sum is 37.

The spelling of 1114013514961 in words is "one trillion, one hundred fourteen billion, thirteen million, five hundred fourteen thousand, nine hundred sixty-one".