Search a number
-
+
2675477393 is a prime number
BaseRepresentation
bin1001111101111000…
…1000101110010001
320220110101100000022
42133132020232101
520434410234033
61121252433225
7123205116431
oct23736105621
96813340008
102675477393
111153267846
12628018815
133383ab924
141b548c2c1
15109d3e098
hex9f788b91

2675477393 has 2 divisors, whose sum is σ = 2675477394. Its totient is φ = 2675477392.

The previous prime is 2675477339. The next prime is 2675477407. The reversal of 2675477393 is 3937745762.

Together with previous prime (2675477339) 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., 2098372864 + 577104529 = 45808^2 + 24023^2 .

It is a cyclic number.

It is not a de Polignac number, because 2675477393 - 28 = 2675477137 is a prime.

It is a super-4 number, since 4×26754773934 (a number of 39 digits) contains 4444 as substring.

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

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

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

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

Almost surely, 22675477393 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 6667920, while the sum is 53.

The square root of 2675477393 is about 51725.0170903790. The cubic root of 2675477393 is about 1388.2481238643.

The spelling of 2675477393 in words is "two billion, six hundred seventy-five million, four hundred seventy-seven thousand, three hundred ninety-three".