Search a number
-
+
3020147215157 is a prime number
BaseRepresentation
bin101011111100101110110…
…011010100101100110101
3101200201112020210211221002
4223330232303110230311
5343440230141341112
610231234140133045
7431125030521512
oct53745663245465
911621466724832
103020147215157
11a64923405716
124093a9237185
1318ba4c86cca7
14a6266980309
155386338e1c2
hex2bf2ecd4b35

3020147215157 has 2 divisors, whose sum is σ = 3020147215158. Its totient is φ = 3020147215156.

The previous prime is 3020147215117. The next prime is 3020147215177. The reversal of 3020147215157 is 7515127410203.

3020147215157 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 2072949171076 + 947198044081 = 1439774^2 + 973241^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

Almost surely, 23020147215157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 58800, while the sum is 38.

The spelling of 3020147215157 in words is "three trillion, twenty billion, one hundred forty-seven million, two hundred fifteen thousand, one hundred fifty-seven".