Base | Representation |
---|---|
bin | 1110101111001100… |
… | …0000010000001001 |
3 | 101012200221102221012 |
4 | 3223303000100021 |
5 | 31100220004022 |
6 | 1452315053305 |
7 | 200014403513 |
oct | 35363002011 |
9 | 11180842835 |
10 | 3956016137 |
11 | 1750082527 |
12 | 924a41235 |
13 | 4b0791768 |
14 | 297584bb3 |
15 | 182487de2 |
hex | ebcc0409 |
3956016137 has 4 divisors (see below), whose sum is σ = 3964946640. Its totient is φ = 3947085636.
The previous prime is 3956016133. The next prime is 3956016151. The reversal of 3956016137 is 7316106593.
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 a cyclic number.
It is not a de Polignac number, because 3956016137 - 22 = 3956016133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3956016094 and 3956016103.
It is not an unprimeable number, because it can be changed into a prime (3956016131) 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 in 3 ways as a sum of consecutive naturals, for example, 4464587 + ... + 4465472.
It is an arithmetic number, because the mean of its divisors is an integer number (991236660).
Almost surely, 23956016137 is an apocalyptic number.
It is an amenable number.
3956016137 is a deficient number, since it is larger than the sum of its proper divisors (8930503).
3956016137 is an equidigital number, since it uses as much as digits as its factorization.
3956016137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8930502.
The product of its (nonzero) digits is 102060, while the sum is 41.
The square root of 3956016137 is about 62896.8690556215. The cubic root of 3956016137 is about 1581.5612587869.
The spelling of 3956016137 in words is "three billion, nine hundred fifty-six million, sixteen thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •