Search a number
-
+
506007031613 is a prime number
BaseRepresentation
bin1110101110100000101…
…11101000111100111101
31210101002111111112110212
413113100113220330331
531242300300002423
61024242330442205
751362216542136
oct7272027507475
91711074445425
10506007031613
11185661861236
1282098893365
1338940809255
141a6c2d42c8d
15d2681a9578
hex75d05e8f3d

506007031613 has 2 divisors, whose sum is σ = 506007031614. Its totient is φ = 506007031612.

The previous prime is 506007031561. The next prime is 506007031631. The reversal of 506007031613 is 316130700605.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 343135865284 + 162871166329 = 585778^2 + 403573^2 .

It is a cyclic number.

It is not a de Polignac number, because 506007031613 - 210 = 506007030589 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 506007031613.

It is a congruent number.

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

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

Almost surely, 2506007031613 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 11340, while the sum is 32.

The spelling of 506007031613 in words is "five hundred six billion, seven million, thirty-one thousand, six hundred thirteen".