Search a number
-
+
101301302302159 is a prime number
BaseRepresentation
bin10111000010001000001100…
…001000111001010111001111
3111021200022100221011210020011
4113002020030020321113033
5101234210031342132114
6555241101551134051
730223530464203141
oct2702101410712717
9437608327153204
10101301302302159
112a306706259243
12b440a55214327
13446a896ca317b
141b0301b31ac91
15baa12cbdc1c4
hex5c220c2395cf

101301302302159 has 2 divisors, whose sum is σ = 101301302302160. Its totient is φ = 101301302302158.

The previous prime is 101301302302133. The next prime is 101301302302201. The reversal of 101301302302159 is 951203203103101.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 101301302302159 - 213 = 101301302293967 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2101301302302159 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 4860, while the sum is 31.

The spelling of 101301302302159 in words is "one hundred one trillion, three hundred one billion, three hundred two million, three hundred two thousand, one hundred fifty-nine".