Search a number
-
+
6900001111039 is a prime number
BaseRepresentation
bin110010001101000100000…
…0111010111101111111111
3220102122002221102002012011
41210122020013113233333
51401022200241023124
622401452230152051
71311336313506661
oct144321007275777
926378087362164
106900001111039
112220301820a63
129353244b2627
133b088a11780a
1419bd673c4531
15be741633994
hex646881d7bff

6900001111039 has 2 divisors, whose sum is σ = 6900001111040. Its totient is φ = 6900001111038.

The previous prime is 6900001111033. The next prime is 6900001111043. The reversal of 6900001111039 is 9301111000096.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 6900001111039 - 219 = 6900000586751 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 6900001111039.

It is a congruent number.

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

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

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

Almost surely, 26900001111039 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1458, while the sum is 31.

The spelling of 6900001111039 in words is "six trillion, nine hundred billion, one million, one hundred eleven thousand, thirty-nine".