Search a number
-
+
3691048513 is a prime number
BaseRepresentation
bin1101110000000000…
…1110111001000001
3100112020100200200111
43130000032321001
530024402023023
61410131551321
7160316252245
oct33400167101
910466320614
103691048513
111624556419
1287015b541
1346a90b399
142702d0425
1516909900d
hexdc00ee41

3691048513 has 2 divisors, whose sum is σ = 3691048514. Its totient is φ = 3691048512.

The previous prime is 3691048469. The next prime is 3691048523. The reversal of 3691048513 is 3158401963.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1921331889 + 1769716624 = 43833^2 + 42068^2 .

It is a cyclic number.

It is not a de Polignac number, because 3691048513 - 217 = 3690917441 is a prime.

It is a super-2 number, since 2×36910485132 = 27247678250639022338, which contains 22 as substring.

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

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

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

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

Almost surely, 23691048513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 77760, while the sum is 40.

The square root of 3691048513 is about 60753.9999753103. Note that the first 4 decimals coincide. The cubic root of 3691048513 is about 1545.4320612020.

The spelling of 3691048513 in words is "three billion, six hundred ninety-one million, forty-eight thousand, five hundred thirteen".