Search a number
-
+
6001010007413 is a prime number
BaseRepresentation
bin101011101010011100000…
…0100011101110101110101
3210020200122201001020121012
41113110320010131311311
51241310032030214123
620432454223002005
71156362423302201
oct127247004356565
923220581036535
106001010007413
111a04017780a23
1280b052139305
13346b7b692015
1416a643dc3b01
15a6177994378
hex5753811dd75

6001010007413 has 2 divisors, whose sum is σ = 6001010007414. Its totient is φ = 6001010007412.

The previous prime is 6001010007361. The next prime is 6001010007521. The reversal of 6001010007413 is 3147000101006.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 3870277159204 + 2130732848209 = 1967302^2 + 1459703^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

Almost surely, 26001010007413 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 6001010007413 its reverse (3147000101006), we get a palindrome (9148010108419).

The spelling of 6001010007413 in words is "six trillion, one billion, ten million, seven thousand, four hundred thirteen".