Base | Representation |
---|---|
bin | 1111011010110000… |
… | …0111101011111101 |
3 | 101200102210211200212 |
4 | 3312230013223331 |
5 | 31434010322312 |
6 | 1522404002205 |
7 | 204363613322 |
oct | 36654075375 |
9 | 11612724625 |
10 | 4138760957 |
11 | 183424a401 |
12 | 976090365 |
13 | 50c5b6aa6 |
14 | 2b3954b49 |
15 | 193534822 |
hex | f6b07afd |
4138760957 has 2 divisors, whose sum is σ = 4138760958. Its totient is φ = 4138760956.
The previous prime is 4138760933. The next prime is 4138760981. The reversal of 4138760957 is 7590678314.
4138760957 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a balanced prime because it is at equal distance from previous prime (4138760933) and next prime (4138760981).
It can be written as a sum of positive squares in only one way, i.e., 2582774041 + 1555986916 = 50821^2 + 39446^2 .
It is a cyclic number.
It is not a de Polignac number, because 4138760957 - 26 = 4138760893 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4138760987) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2069380478 + 2069380479.
It is an arithmetic number, because the mean of its divisors is an integer number (2069380479).
Almost surely, 24138760957 is an apocalyptic number.
It is an amenable number.
4138760957 is a deficient number, since it is larger than the sum of its proper divisors (1).
4138760957 is an equidigital number, since it uses as much as digits as its factorization.
4138760957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1270080, while the sum is 50.
The square root of 4138760957 is about 64333.2026017670. The cubic root of 4138760957 is about 1605.5485690636.
The spelling of 4138760957 in words is "four billion, one hundred thirty-eight million, seven hundred sixty thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •