Base | Representation |
---|---|
bin | 1001110011001100… |
… | …1110111101010011 |
3 | 20210100002012110211 |
4 | 2130303032331103 |
5 | 20341423120212 |
6 | 1113012304551 |
7 | 122122244140 |
oct | 23463167523 |
9 | 6710065424 |
10 | 2630676307 |
11 | 112aa48056 |
12 | 615012157 |
13 | 32c0239cc |
14 | 1ad5493c7 |
15 | 105e3e9a7 |
hex | 9cccef53 |
2630676307 has 8 divisors (see below), whose sum is σ = 3011613696. Its totient is φ = 2251020552.
The previous prime is 2630676289. The next prime is 2630676311. The reversal of 2630676307 is 7036760362.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2630676307 - 227 = 2496458579 is a prime.
It is a super-2 number, since 2×26306763072 = 13840915664422316498, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2630676307.
It is not an unprimeable number, because it can be changed into a prime (2630670307) 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 7 ways as a sum of consecutive naturals, for example, 316003 + ... + 324220.
It is an arithmetic number, because the mean of its divisors is an integer number (376451712).
Almost surely, 22630676307 is an apocalyptic number.
2630676307 is a deficient number, since it is larger than the sum of its proper divisors (380937389).
2630676307 is an equidigital number, since it uses as much as digits as its factorization.
2630676307 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 640817.
The product of its (nonzero) digits is 190512, while the sum is 40.
The square root of 2630676307 is about 51290.1189996670. The cubic root of 2630676307 is about 1380.4556898447.
The spelling of 2630676307 in words is "two billion, six hundred thirty million, six hundred seventy-six thousand, three hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.131 sec. • engine limits •