Search a number
-
+
1001111969453 is a prime number
BaseRepresentation
bin11101001000101101110…
…11000101111010101101
310112201001012210022210212
432210112323011322231
5112400234131010303
62043523211512205
7132220326223331
oct16442673057255
93481035708725
101001111969453
11356629676012
12142032458665
137353477a62b
143664ddbd7c1
151b0941b3ad8
hexe916ec5ead

1001111969453 has 2 divisors, whose sum is σ = 1001111969454. Its totient is φ = 1001111969452.

The previous prime is 1001111969449. The next prime is 1001111969467. The reversal of 1001111969453 is 3549691111001.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 870933164644 + 130178804809 = 933238^2 + 360803^2 .

It is a cyclic number.

It is not a de Polignac number, because 1001111969453 - 22 = 1001111969449 is a prime.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 21001111969453 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 29160, while the sum is 41.

The spelling of 1001111969453 in words is "one trillion, one billion, one hundred eleven million, nine hundred sixty-nine thousand, four hundred fifty-three".