Search a number
-
+
20333011000069 is a prime number
BaseRepresentation
bin1001001111110001001011…
…11001011101101100000101
32122222211001111102002101001
410213320211321131230011
510131114001304000234
6111124504543333301
74166003652562045
oct447704571355405
978884044362331
1020333011000069
11652a1aa6a1279
1223448102b1231
13b46519240a81
145041a1675725
15253d95686d14
hex127e25e5db05

20333011000069 has 2 divisors, whose sum is σ = 20333011000070. Its totient is φ = 20333011000068.

The previous prime is 20333011000019. The next prime is 20333011000097. The reversal of 20333011000069 is 96000011033302.

It is an a-pointer prime, because the next prime (20333011000097) can be obtained adding 20333011000069 to its sum of digits (28).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 16357672869444 + 3975338130625 = 4044462^2 + 1993825^2 .

It is a cyclic number.

It is not a de Polignac number, because 20333011000069 - 227 = 20332876782341 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 220333011000069 is an apocalyptic number.

It is an amenable number.

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

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

20333011000069 is an evil number, because the sum of its binary digits is even.

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

The spelling of 20333011000069 in words is "twenty trillion, three hundred thirty-three billion, eleven million, sixty-nine", and thus it is an aban number.