Search a number
-
+
5110330991401 is a prime number
BaseRepresentation
bin100101001011101011101…
…1101101010001100101001
3200002112122202100012122001
41022113113131222030221
51132211424213211101
614511353104331001
71035131523500116
oct112272735521451
920075582305561
105110330991401
1116a0308689389
126a64bb613a61
132b0b9602026c
141394ac8c990d
158cde88ea901
hex4a5d776a329

5110330991401 has 2 divisors, whose sum is σ = 5110330991402. Its totient is φ = 5110330991400.

The previous prime is 5110330991357. The next prime is 5110330991407. The reversal of 5110330991401 is 1041990330115.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 3934192910400 + 1176138081001 = 1983480^2 + 1084499^2 .

It is a cyclic number.

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

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

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

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

Almost surely, 25110330991401 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 14580, while the sum is 37.

The spelling of 5110330991401 in words is "five trillion, one hundred ten billion, three hundred thirty million, nine hundred ninety-one thousand, four hundred one".