Search a number
-
+
76999901111101 is a prime number
BaseRepresentation
bin10001100000011111101111…
…110000001110001100111101
3101002122010012111111200010001
4101200133233300032030331
540043031244141023401
6431433133301314301
722135026221246353
oct2140375760161475
9332563174450101
1076999901111101
1122597524880801
12877711b105991
1333c70a09ba497
141502b5a8b97d3
158d7e266ae601
hex4607efc0e33d

76999901111101 has 2 divisors, whose sum is σ = 76999901111102. Its totient is φ = 76999901111100.

The previous prime is 76999901111071. The next prime is 76999901111129. The reversal of 76999901111101 is 10111110999967.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 74205992204100 + 2793908907001 = 8614290^2 + 1671499^2 .

It is an emirp because it is prime and its reverse (10111110999967) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 76999901111101 - 27 = 76999901110973 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 276999901111101 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 275562, while the sum is 55.

The spelling of 76999901111101 in words is "seventy-six trillion, nine hundred ninety-nine billion, nine hundred one million, one hundred eleven thousand, one hundred one".