Search a number
-
+
105650051016667 is a prime number
BaseRepresentation
bin11000000001011010010001…
…110000101110011111011011
3111212002001020201002210112011
4120001122101300232133123
5102321432301030013132
61012410544032330351
731152651516316003
oct3001322160563733
9455061221083464
10105650051016667
1130732a31564913
12ba238303a39b7
1346c49ac35a4b1
141c136bdc4d003
15c33300e2eb47
hex601691c2e7db

105650051016667 has 2 divisors, whose sum is σ = 105650051016668. Its totient is φ = 105650051016666.

The previous prime is 105650051016647. The next prime is 105650051016673. The reversal of 105650051016667 is 766610150056501.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 105650051016667 - 219 = 105650050492379 is a prime.

It is a super-2 number, since 2×1056500510166672 (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 105650051016667.

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

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

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

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

Almost surely, 2105650051016667 is an apocalyptic number.

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

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

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

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

The spelling of 105650051016667 in words is "one hundred five trillion, six hundred fifty billion, fifty-one million, sixteen thousand, six hundred sixty-seven".