Search a number
-
+
1010002021069 is a prime number
BaseRepresentation
bin11101011001010001100…
…11111100101011001101
310120112222202222201222211
432230220303330223031
5113021441004133234
62051553304310421
7132653535346216
oct16545063745315
93515882881884
101010002021069
1135a3808a0408
121438b3772411
1374320512bc2
1436c5497440d
151b4148c3164
hexeb28cfcacd

1010002021069 has 2 divisors, whose sum is σ = 1010002021070. Its totient is φ = 1010002021068.

The previous prime is 1010002020961. The next prime is 1010002021099. The reversal of 1010002021069 is 9601202000101.

Together with previous prime (1010002020961) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 812143416100 + 197858604969 = 901190^2 + 444813^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

Almost surely, 21010002021069 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 1010002021069 in words is "one trillion, ten billion, two million, twenty-one thousand, sixty-nine".