Search a number
-
+
107015301049 is a prime number
BaseRepresentation
bin110001110101010011…
…0111110011110111001
3101020020002011120010111
41203222212332132321
53223131404113144
6121055005144321
710505640023146
oct1435246763671
9336202146114
10107015301049
1141426390668
12188a725b0a1
13a126042057
145272a413cd
152bb5077534
hex18ea9be7b9

107015301049 has 2 divisors, whose sum is σ = 107015301050. Its totient is φ = 107015301048.

The previous prime is 107015301047. The next prime is 107015301067. The reversal of 107015301049 is 940103510701.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 88049879824 + 18965421225 = 296732^2 + 137715^2 .

It is a cyclic number.

It is not a de Polignac number, because 107015301049 - 21 = 107015301047 is a prime.

It is a super-2 number, since 2×1070153010492 (a number of 23 digits) contains 22 as substring.

Together with 107015301047, it forms a pair of twin primes.

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

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

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

Almost surely, 2107015301049 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 107015301049 in words is "one hundred seven billion, fifteen million, three hundred one thousand, forty-nine".