Search a number
-
+
20631502631 is a prime number
BaseRepresentation
bin10011001101101110…
…111011111100100111
31222020211210221000002
4103031232323330213
5314223131041011
613251124411515
71330160610305
oct231556737447
958224727002
1020631502631
118827a44323
123bb9546b9b
131c3a48342c
14dda10d275
1580b40cc3b
hex4cdbbbf27

20631502631 has 2 divisors, whose sum is σ = 20631502632. Its totient is φ = 20631502630.

The previous prime is 20631502613. The next prime is 20631502637. The reversal of 20631502631 is 13620513602.

Together with previous prime (20631502613) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 20631502631 - 214 = 20631486247 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 20631502594 and 20631502603.

It is a congruent number.

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

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

Almost surely, 220631502631 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 6480, while the sum is 29.

The spelling of 20631502631 in words is "twenty billion, six hundred thirty-one million, five hundred two thousand, six hundred thirty-one".