Search a number
-
+
1013131130369 is a prime number
BaseRepresentation
bin11101011111000110101…
…00100011011000000001
310120212001211221221222212
432233203110203120001
5113044343032132434
62053232004111505
7133124222342651
oct16574324433001
93525054857885
101013131130369
11360737124556
12144427695595
13746cb890677
1437070388361
151b54946b8ce
hexebe3523601

1013131130369 has 2 divisors, whose sum is σ = 1013131130370. Its totient is φ = 1013131130368.

The previous prime is 1013131130327. The next prime is 1013131130381. The reversal of 1013131130369 is 9630311313101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 817867009600 + 195264120769 = 904360^2 + 441887^2 .

It is a cyclic number.

It is not a de Polignac number, because 1013131130369 - 216 = 1013131064833 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 21013131130369 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4374, while the sum is 32.

The spelling of 1013131130369 in words is "one trillion, thirteen billion, one hundred thirty-one million, one hundred thirty thousand, three hundred sixty-nine".