Base | Representation |
---|---|
bin | 1001110011001101… |
… | …0110011111000101 |
3 | 20210100010202202211 |
4 | 2130303112133011 |
5 | 20341430112031 |
6 | 1113013103421 |
7 | 122122433056 |
oct | 23463263705 |
9 | 6710122684 |
10 | 2630707141 |
11 | 112aa69237 |
12 | 615027b71 |
13 | 32c034a5a |
14 | 1ad55672d |
15 | 105e48bb1 |
hex | 9ccd67c5 |
2630707141 has 4 divisors (see below), whose sum is σ = 2701807372. Its totient is φ = 2559606912.
The previous prime is 2630707117. The next prime is 2630707147. The reversal of 2630707141 is 1417070362.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1417070362 = 2 ⋅708535181.
It can be written as a sum of positive squares in 2 ways, for example, as 1350856516 + 1279850625 = 36754^2 + 35775^2 .
It is a cyclic number.
It is not a de Polignac number, because 2630707141 - 219 = 2630182853 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 (2630707147) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 35550060 + ... + 35550133.
It is an arithmetic number, because the mean of its divisors is an integer number (675451843).
Almost surely, 22630707141 is an apocalyptic number.
It is an amenable number.
2630707141 is a deficient number, since it is larger than the sum of its proper divisors (71100231).
2630707141 is an equidigital number, since it uses as much as digits as its factorization.
2630707141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 71100230.
The product of its (nonzero) digits is 7056, while the sum is 31.
The square root of 2630707141 is about 51290.4195829981. The cubic root of 2630707141 is about 1380.4610832366.
The spelling of 2630707141 in words is "two billion, six hundred thirty million, seven hundred seven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •