Base | Representation |
---|---|
bin | 111101010100101… |
… | …1010011110011101 |
3 | 12022101212210210012 |
4 | 1322221122132131 |
5 | 13203231123301 |
6 | 540103053005 |
7 | 101663651303 |
oct | 17251323635 |
9 | 5271783705 |
10 | 2057676701 |
11 | 966560a63 |
12 | 495141165 |
13 | 26a3bc9a2 |
14 | 1573d0273 |
15 | c09a6ebb |
hex | 7aa5a79d |
2057676701 has 4 divisors (see below), whose sum is σ = 2128631100. Its totient is φ = 1986722304.
The previous prime is 2057676667. The next prime is 2057676749. The reversal of 2057676701 is 1076767502.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1030474201 + 1027202500 = 32101^2 + 32050^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2057676701 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2057676781) 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, 35477156 + ... + 35477213.
It is an arithmetic number, because the mean of its divisors is an integer number (532157775).
Almost surely, 22057676701 is an apocalyptic number.
It is an amenable number.
2057676701 is a deficient number, since it is larger than the sum of its proper divisors (70954399).
2057676701 is an equidigital number, since it uses as much as digits as its factorization.
2057676701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70954398.
The product of its (nonzero) digits is 123480, while the sum is 41.
The square root of 2057676701 is about 45361.6214547055. The cubic root of 2057676701 is about 1271.9178045476.
The spelling of 2057676701 in words is "two billion, fifty-seven million, six hundred seventy-six thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •