Search a number
-
+
100747323115267 is a prime number
BaseRepresentation
bin10110111010000100010000…
…011010000000011100000011
3111012201100110011121021010111
4112322010100122000130003
5101201121004204142032
6554134403054412151
730135516404620663
oct2672042032003403
9435640404537114
10100747323115267
112a11277746a794
12b37160a801057
13442a57c8a052a
141ac42a71101a3
15b9aa08200c47
hex5ba110680703

100747323115267 has 2 divisors, whose sum is σ = 100747323115268. Its totient is φ = 100747323115266.

The previous prime is 100747323115147. The next prime is 100747323115279. The reversal of 100747323115267 is 762511323747001.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 100747323115267 - 231 = 100745175631619 is a prime.

It is a super-2 number, since 2×1007473231152672 (a number of 29 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 100747323115267.

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

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

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

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

Almost surely, 2100747323115267 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1481760, while the sum is 49.

The spelling of 100747323115267 in words is "one hundred trillion, seven hundred forty-seven billion, three hundred twenty-three million, one hundred fifteen thousand, two hundred sixty-seven".