105674267651 has 2 divisors, whose sum is σ = 105674267652. Its totient is φ = 105674267650.

The previous prime is 105674267609. The next prime is 105674267689. The reversal of 105674267651 is 156762476501.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 105674267651 - 2²² = 105670073347 is a prime.

It is a super-2 number, since 2×105674267651² (a number of 23 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 105674267651.

It is not a weakly prime, because it can be changed into another prime (105671267651) 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, 52837133825 + 52837133826.

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

Almost surely, 2^105674267651 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2116800, while the sum is 50.

The spelling of 105674267651 in words is "one hundred five billion, six hundred seventy-four million, two hundred sixty-seven thousand, six hundred fifty-one".