Search a number
-
+
10331217151 is a prime number
BaseRepresentation
bin10011001111100100…
…11101110011111111
3222200000000012122021
421213302131303333
5132124242422101
64425053501011
7514005616423
oct114762356377
928600005567
1010331217151
1144217803a2
122003aa1767
13c884c8258
14700140b83
15406ed65a1
hex267c9dcff

10331217151 has 2 divisors, whose sum is σ = 10331217152. Its totient is φ = 10331217150.

The previous prime is 10331217107. The next prime is 10331217223. The reversal of 10331217151 is 15171213301.

It is a weak prime.

It is an emirp because it is prime and its reverse (15171213301) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 10331217151 - 213 = 10331208959 is a prime.

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

It is a congruent number.

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

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

Almost surely, 210331217151 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 630, while the sum is 25.

The spelling of 10331217151 in words is "ten billion, three hundred thirty-one million, two hundred seventeen thousand, one hundred fifty-one".