Base | Representation |
---|---|
bin | 1001101011010101… |
… | …0010010110011101 |
3 | 20201000221210200220 |
4 | 2122311102112131 |
5 | 20310000110221 |
6 | 1105432511553 |
7 | 121241513643 |
oct | 23265222635 |
9 | 6630853626 |
10 | 2597660061 |
11 | 11133474a7 |
12 | 605b4b5b9 |
13 | 325233b79 |
14 | 1a8dd3193 |
15 | 1030bc0c6 |
hex | 9ad5259d |
2597660061 has 16 divisors (see below), whose sum is σ = 3745315584. Its totient is φ = 1595224064.
The previous prime is 2597660059. The next prime is 2597660063. The reversal of 2597660061 is 1600667952.
It is an interprime number because it is at equal distance from previous prime (2597660059) and next prime (2597660063).
It is a cyclic number.
It is not a de Polignac number, because 2597660061 - 21 = 2597660059 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2597659995 and 2597660022.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2597660063) 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 in 15 ways as a sum of consecutive naturals, for example, 539460 + ... + 544253.
It is an arithmetic number, because the mean of its divisors is an integer number (234082224).
Almost surely, 22597660061 is an apocalyptic number.
It is an amenable number.
2597660061 is a deficient number, since it is larger than the sum of its proper divisors (1147655523).
2597660061 is a wasteful number, since it uses less digits than its factorization.
2597660061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1083780.
The product of its (nonzero) digits is 136080, while the sum is 42.
The square root of 2597660061 is about 50967.2449814584. The cubic root of 2597660061 is about 1374.6562333561.
The spelling of 2597660061 in words is "two billion, five hundred ninety-seven million, six hundred sixty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •