Search a number
-
+
130320323023031 is a prime number
BaseRepresentation
bin11101101000011010010000…
…100011111001000010110111
3122002102111112101021212001122
4131220122100203321002313
5114040132010143214111
61141100155132014155
736310222043400131
oct3550322043710267
9562374471255048
10130320323023031
11385845a19a2529
1212748b5060135b
1357941cc98a8bb
142427774470051
15100ede602dcdb
hex7686908f90b7

130320323023031 has 2 divisors, whose sum is σ = 130320323023032. Its totient is φ = 130320323023030.

The previous prime is 130320323022971. The next prime is 130320323023043.

It is a happy number.

130320323023031 is nontrivially palindromic in base 10.

It is a strong prime.

It is a palprime.

It is a cyclic number.

It is not a de Polignac number, because 130320323023031 - 210 = 130320323022007 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2130320323023031 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 5832, while the sum is 26.

The spelling of 130320323023031 in words is "one hundred thirty trillion, three hundred twenty billion, three hundred twenty-three million, twenty-three thousand, thirty-one".