Base | Representation |
---|---|
bin | 1110111111000011000101 |
3 | 21101120120011 |
4 | 32333003011 |
5 | 2001201021 |
6 | 220110221 |
7 | 45250441 |
oct | 16770305 |
9 | 7346504 |
10 | 3928261 |
11 | 22433a7 |
12 | 1395371 |
13 | a7701c |
14 | 743821 |
15 | 528de1 |
hex | 3bf0c5 |
3928261 has 2 divisors, whose sum is σ = 3928262. Its totient is φ = 3928260.
The previous prime is 3928259. The next prime is 3928273. The reversal of 3928261 is 1628293.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2825761 + 1102500 = 1681^2 + 1050^2 .
It is an emirp because it is prime and its reverse (1628293) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3928261 - 21 = 3928259 is a prime.
Together with 3928259, it forms a pair of twin primes.
It is a Chen prime.
It is a d-powerful number, because it can be written as 39 + 93 + 217 + 8 + 221 + 68 + 1 .
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3928361) 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, 1964130 + 1964131.
It is an arithmetic number, because the mean of its divisors is an integer number (1964131).
Almost surely, 23928261 is an apocalyptic number.
It is an amenable number.
3928261 is a deficient number, since it is larger than the sum of its proper divisors (1).
3928261 is an equidigital number, since it uses as much as digits as its factorization.
3928261 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5184, while the sum is 31.
The square root of 3928261 is about 1981.9841068989. The cubic root of 3928261 is about 157.7853866631.
Subtracting from 3928261 its reverse (1628293), we obtain a cube (2299968 = 1323).
The spelling of 3928261 in words is "three million, nine hundred twenty-eight thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •