Base | Representation |
---|---|
bin | 111101010100100… |
… | …1010111010100101 |
3 | 12022101202120100121 |
4 | 1322221022322211 |
5 | 13203222103330 |
6 | 540101441541 |
7 | 101663264422 |
oct | 17251127245 |
9 | 5271676317 |
10 | 2057612965 |
11 | 966518091 |
12 | 4951102b1 |
13 | 26a399985 |
14 | 1573b4d49 |
15 | c099317a |
hex | 7aa4aea5 |
2057612965 has 4 divisors (see below), whose sum is σ = 2469135564. Its totient is φ = 1646090368.
The previous prime is 2057612929. The next prime is 2057612971. The reversal of 2057612965 is 5692167502.
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 403889409 + 1653723556 = 20097^2 + 40666^2 .
It is a cyclic number.
It is not a de Polignac number, because 2057612965 - 215 = 2057580197 is a prime.
It is a super-2 number, since 2×20576129652 = 8467542227472182450, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 in 3 ways as a sum of consecutive naturals, for example, 205761292 + ... + 205761301.
It is an arithmetic number, because the mean of its divisors is an integer number (617283891).
Almost surely, 22057612965 is an apocalyptic number.
It is an amenable number.
2057612965 is a deficient number, since it is larger than the sum of its proper divisors (411522599).
2057612965 is an equidigital number, since it uses as much as digits as its factorization.
2057612965 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 411522598.
The product of its (nonzero) digits is 226800, while the sum is 43.
The square root of 2057612965 is about 45360.9189170590. The cubic root of 2057612965 is about 1271.9046719710.
The spelling of 2057612965 in words is "two billion, fifty-seven million, six hundred twelve thousand, nine hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •