Search a number
-
+
1010001101969 is a prime number
BaseRepresentation
bin11101011001010001100…
…00011100010010010001
310120112222201021001020002
432230220300130102101
5113021440240230334
62051553232455345
7132653524500506
oct16545060342221
93515881231202
101010001101969
1135a380322922
121438b33aa555
1374320280762
1436c547b54ad
151b414790b7e
hexeb28c1c491

1010001101969 has 2 divisors, whose sum is σ = 1010001101970. Its totient is φ = 1010001101968.

The previous prime is 1010001101951. The next prime is 1010001101983. The reversal of 1010001101969 is 9691011000101.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 671108300944 + 338892801025 = 819212^2 + 582145^2 .

It is a cyclic number.

It is not a de Polignac number, because 1010001101969 - 212 = 1010001097873 is a prime.

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

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

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

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

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

Almost surely, 21010001101969 is an apocalyptic number.

It is an amenable number.

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

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

1010001101969 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 29.

The spelling of 1010001101969 in words is "one trillion, ten billion, one million, one hundred one thousand, nine hundred sixty-nine".