Search a number
-
+
6010000915133 is a prime number
BaseRepresentation
bin101011101110100111111…
…1110000011101010111101
3210021112212022000200100102
41113131033332003222331
51241431440213241013
620440542321210445
71160131265614145
oct127351776035275
923245768020312
106010000915133
111a07910921a76
12810941190a25
133479822aa967
1416ac5810d925
15a6501e76d58
hex5774ff83abd

6010000915133 has 2 divisors, whose sum is σ = 6010000915134. Its totient is φ = 6010000915132.

The previous prime is 6010000914899. The next prime is 6010000915157. The reversal of 6010000915133 is 3315190000106.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 4384279013689 + 1625721901444 = 2093867^2 + 1275038^2 .

It is a cyclic number.

It is not a de Polignac number, because 6010000915133 - 214 = 6010000898749 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 26010000915133 is an apocalyptic number.

It is an amenable number.

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

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

6010000915133 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 2430, while the sum is 29.

Adding to 6010000915133 its reverse (3315190000106), we get a palindrome (9325190915239).

The spelling of 6010000915133 in words is "six trillion, ten billion, nine hundred fifteen thousand, one hundred thirty-three".