Base | Representation |
---|---|
bin | 1110100010111011… |
… | …1110000111011001 |
3 | 101002010020121111210 |
4 | 3220232332013121 |
5 | 30444041032121 |
6 | 1443241413333 |
7 | 165521532441 |
oct | 35056760731 |
9 | 11063217453 |
10 | 3904627161 |
11 | 17240731a6 |
12 | 90b79a249 |
13 | 4a2c3b096 |
14 | 290809121 |
15 | 17cbd6876 |
hex | e8bbe1d9 |
3904627161 has 4 divisors (see below), whose sum is σ = 5206169552. Its totient is φ = 2603084772.
The previous prime is 3904627157. The next prime is 3904627171. The reversal of 3904627161 is 1617264093.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 3904627161 - 22 = 3904627157 is a prime.
It is a super-2 number, since 2×39046271612 = 30492226532837839842, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3904627151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 650771191 + ... + 650771196.
It is an arithmetic number, because the mean of its divisors is an integer number (1301542388).
Almost surely, 23904627161 is an apocalyptic number.
It is an amenable number.
3904627161 is a deficient number, since it is larger than the sum of its proper divisors (1301542391).
3904627161 is a wasteful number, since it uses less digits than its factorization.
3904627161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1301542390.
The product of its (nonzero) digits is 54432, while the sum is 39.
The square root of 3904627161 is about 62487.0159393133. The cubic root of 3904627161 is about 1574.6831862641.
The spelling of 3904627161 in words is "three billion, nine hundred four million, six hundred twenty-seven thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •