Search a number
-
+
1013021111969 is a prime number
BaseRepresentation
bin11101011110111001100…
…00110111011010100001
310120211210011221110010022
432233130300313122201
5113044131401040334
62053213034043225
7133121415243416
oct16573460673241
93524704843108
101013021111969
11360690010059
121443b6879515
13746b1b4cb19
143705d90a10d
151b53e98882e
hexebdcc376a1

1013021111969 has 2 divisors, whose sum is σ = 1013021111970. Its totient is φ = 1013021111968.

The previous prime is 1013021111939. The next prime is 1013021112031. The reversal of 1013021111969 is 9691111203101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 533028487744 + 479992624225 = 730088^2 + 692815^2 .

It is a cyclic number.

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

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

It is not a weakly prime, because it can be changed into another prime (1013021111939) 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, 506510555984 + 506510555985.

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

Almost surely, 21013021111969 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2916, while the sum is 35.

The spelling of 1013021111969 in words is "one trillion, thirteen billion, twenty-one million, one hundred eleven thousand, nine hundred sixty-nine".