Search a number
-
+
331333301100127 is a prime number
BaseRepresentation
bin100101101010110001000101…
…1101101101101111001011111
31121110011011011102212222000011
41023111202023231231321133
5321412031100040201002
63132404230041144051
7126535020035423314
oct11325421355557137
91543134142788004
10331333301100127
11966337336a2117
12311b274418b027
13112b5799bac571
145bb688dd9ad0b
152848b15da58d7
hex12d588bb6de5f

331333301100127 has 2 divisors, whose sum is σ = 331333301100128. Its totient is φ = 331333301100126.

The previous prime is 331333301100121. The next prime is 331333301100133. The reversal of 331333301100127 is 721001103333133.

It is a balanced prime because it is at equal distance from previous prime (331333301100121) and next prime (331333301100133).

It is a cyclic number.

It is not a de Polignac number, because 331333301100127 - 219 = 331333300575839 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2331333301100127 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 10206, while the sum is 31.

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