Search a number
-
+
10001010111073 is a prime number
BaseRepresentation
bin1001000110001000101010…
…1001111011001001100001
31022102002100120221012201121
42101202022221323021201
52302324032042023243
633134222311132241
72051356232216452
oct221421251731141
938362316835647
1010001010111073
11320644a533463
12115631a074081
135771254c5997
142680a134d129
151252389701ed
hex9188aa7b261

10001010111073 has 2 divisors, whose sum is σ = 10001010111074. Its totient is φ = 10001010111072.

The previous prime is 10001010111061. The next prime is 10001010111077. The reversal of 10001010111073 is 37011101010001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9832194310689 + 168815800384 = 3135633^2 + 410872^2 .

It is a cyclic number.

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

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

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

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

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

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

Almost surely, 210001010111073 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 21, while the sum is 16.

Adding to 10001010111073 its reverse (37011101010001), we get a palindrome (47012111121074).

The spelling of 10001010111073 in words is "ten trillion, one billion, ten million, one hundred eleven thousand, seventy-three".