Base | Representation |
---|---|
bin | 1110110111101010… |
… | …1111000000000101 |
3 | 101022011220010210012 |
4 | 3231322233000011 |
5 | 31133322101221 |
6 | 1500025440005 |
7 | 200626005134 |
oct | 35572570005 |
9 | 11264803705 |
10 | 3991597061 |
11 | 1769174a51 |
12 | 934940005 |
13 | 4b7c6ba6a |
14 | 29c1a791b |
15 | 18566565b |
hex | edeaf005 |
3991597061 has 2 divisors, whose sum is σ = 3991597062. Its totient is φ = 3991597060.
The previous prime is 3991597009. The next prime is 3991597069. The reversal of 3991597061 is 1607951993.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3954020161 + 37576900 = 62881^2 + 6130^2 .
It is a cyclic number.
It is not a de Polignac number, because 3991597061 - 26 = 3991596997 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3991597069) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1995798530 + 1995798531.
It is an arithmetic number, because the mean of its divisors is an integer number (1995798531).
Almost surely, 23991597061 is an apocalyptic number.
It is an amenable number.
3991597061 is a deficient number, since it is larger than the sum of its proper divisors (1).
3991597061 is an equidigital number, since it uses as much as digits as its factorization.
3991597061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 459270, while the sum is 50.
The square root of 3991597061 is about 63179.0872124630. The cubic root of 3991597061 is about 1586.2887031703.
The spelling of 3991597061 in words is "three billion, nine hundred ninety-one million, five hundred ninety-seven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •