101099047359367 has 2 divisors, whose sum is σ = 101099047359368. Its totient is φ = 101099047359366.

The previous prime is 101099047359337. The next prime is 101099047359391. The reversal of 101099047359367 is 763953740990101.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-101099047359367 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 101099047359299 and 101099047359308.

It is a congruent number.

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

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

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

Almost surely, 2^{101099047359367} is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 38578680, while the sum is 64.

The spelling of 101099047359367 in words is "one hundred one trillion, ninety-nine billion, forty-seven million, three hundred fifty-nine thousand, three hundred sixty-seven".