Search a number
-
+
1013540117 is a prime number
BaseRepresentation
bin111100011010010…
…110010100010101
32121122011011122212
4330122112110111
54033431240432
6244323403205
734054643312
oct7432262425
92548134585
101013540117
11480131767
12243523505
13131c9b1a5
1498873d09
155dea82b2
hex3c696515

1013540117 has 2 divisors, whose sum is σ = 1013540118. Its totient is φ = 1013540116.

The previous prime is 1013540107. The next prime is 1013540159. The reversal of 1013540117 is 7110453101.

It is a happy number.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 793492561 + 220047556 = 28169^2 + 14834^2 .

It is a cyclic number.

It is not a de Polignac number, because 1013540117 - 28 = 1013539861 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 1013540092 and 1013540101.

It is a congruent number.

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

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

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

Almost surely, 21013540117 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 420, while the sum is 23.

The square root of 1013540117 is about 31836.1448199998. The cubic root of 1013540117 is about 1004.4931536669.

Adding to 1013540117 its reverse (7110453101), we get a palindrome (8123993218).

The spelling of 1013540117 in words is "one billion, thirteen million, five hundred forty thousand, one hundred seventeen".