Base | Representation |
---|---|
bin | 1001110011001101… |
… | …0000000000011101 |
3 | 20210100002102101000 |
4 | 2130303100000131 |
5 | 20341423234410 |
6 | 1113012340513 |
7 | 122122262520 |
oct | 23463200035 |
9 | 6710072330 |
10 | 2630680605 |
11 | 112aa50303 |
12 | 615014739 |
13 | 32c025957 |
14 | 1ad54abb7 |
15 | 105e40dc0 |
hex | 9ccd001d |
2630680605 has 32 divisors (see below), whose sum is σ = 5344876800. Its totient is φ = 1202596416.
The previous prime is 2630680603. The next prime is 2630680621. The reversal of 2630680605 is 5060860362.
It is not a de Polignac number, because 2630680605 - 21 = 2630680603 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2630680605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2630680603) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1390950 + ... + 1392839.
It is an arithmetic number, because the mean of its divisors is an integer number (167027400).
Almost surely, 22630680605 is an apocalyptic number.
It is an amenable number.
2630680605 is an abundant number, since it is smaller than the sum of its proper divisors (2714196195).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2630680605 is a wasteful number, since it uses less digits than its factorization.
2630680605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2783810 (or 2783804 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 36.
The square root of 2630680605 is about 51290.1608985583. The cubic root of 2630680605 is about 1380.4564416407.
The spelling of 2630680605 in words is "two billion, six hundred thirty million, six hundred eighty thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •