Base | Representation |
---|---|
bin | 1110110000101111… |
… | …0100001001100001 |
3 | 101020011011212202222 |
4 | 3230023310021201 |
5 | 31103401121121 |
6 | 1453110320425 |
7 | 200123602625 |
oct | 35413641141 |
9 | 11204155688 |
10 | 3962520161 |
11 | 1753815056 |
12 | 927059115 |
13 | 4b1c2acb2 |
14 | 298399185 |
15 | 182d200ab |
hex | ec2f4261 |
3962520161 has 4 divisors (see below), whose sum is σ = 4090343424. Its totient is φ = 3834696900.
The previous prime is 3962520139. The next prime is 3962520203. The reversal of 3962520161 is 1610252693.
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, and also an emirpimes, since its reverse is a distinct semiprime: 1610252693 = 7 ⋅230036099.
It is not a de Polignac number, because 3962520161 - 222 = 3958325857 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3962520101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 63911585 + ... + 63911646.
It is an arithmetic number, because the mean of its divisors is an integer number (1022585856).
Almost surely, 23962520161 is an apocalyptic number.
3962520161 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
It is an amenable number.
3962520161 is a deficient number, since it is larger than the sum of its proper divisors (127823263).
3962520161 is a wasteful number, since it uses less digits than its factorization.
3962520161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127823262.
The product of its (nonzero) digits is 19440, while the sum is 35.
The square root of 3962520161 is about 62948.5516989867. The cubic root of 3962520161 is about 1582.4275242312.
The spelling of 3962520161 in words is "three billion, nine hundred sixty-two million, five hundred twenty thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •