Search a number
-
+
168133613 is a prime number
BaseRepresentation
bin10100000010110…
…00001111101101
3102201101001221212
422001120033231
5321020233423
624403404205
74111053314
oct1201301755
9381331855
10168133613
11869a82aa
1248383665
1328aaa95b
141848927b
15eb62578
hexa0583ed

168133613 has 2 divisors, whose sum is σ = 168133614. Its totient is φ = 168133612.

The previous prime is 168133607. The next prime is 168133631. The reversal of 168133613 is 316331861.

Together with next prime (168133631) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 165817129 + 2316484 = 12877^2 + 1522^2 .

It is a cyclic number.

It is not a de Polignac number, because 168133613 - 24 = 168133597 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 168133613.

It is a congruent number.

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

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

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

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

Almost surely, 2168133613 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 7776, while the sum is 32.

The square root of 168133613 is about 12966.6346057873. The cubic root of 168133613 is about 551.9310775198.

The spelling of 168133613 in words is "one hundred sixty-eight million, one hundred thirty-three thousand, six hundred thirteen".