Search a number
-
+
13330312110767 is a prime number
BaseRepresentation
bin1100000111111011010010…
…0001001010001010101111
31202012100212101000022212202
43001332310201022022233
53221400434400021032
644203505535252115
72544040363252601
oct301766441121257
952170771008782
1013330312110767
11427a398736503
1215b360667a03b
1375907372a432
14341294c19171
15181b43071d62
hexc1fb484a2af

13330312110767 has 2 divisors, whose sum is σ = 13330312110768. Its totient is φ = 13330312110766.

The previous prime is 13330312110763. The next prime is 13330312110833. The reversal of 13330312110767 is 76701121303331.

13330312110767 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 13330312110767 - 22 = 13330312110763 is a prime.

It is a super-2 number, since 2×133303121107672 (a number of 27 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 13330312110767.

It is a congruent number.

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

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

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

Almost surely, 213330312110767 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 47628, while the sum is 38.

The spelling of 13330312110767 in words is "thirteen trillion, three hundred thirty billion, three hundred twelve million, one hundred ten thousand, seven hundred sixty-seven".