Base | Representation |
---|---|
bin | 1001110010100110… |
… | …1001111000011011 |
3 | 20210011100121210220 |
4 | 2130221221320123 |
5 | 20340302241042 |
6 | 1112442411123 |
7 | 122062015026 |
oct | 23451517033 |
9 | 6704317726 |
10 | 2628165147 |
11 | 1129592413 |
12 | 614200aa3 |
13 | 32b654a0a |
14 | 1ad0941bd |
15 | 105ae58ec |
hex | 9ca69e1b |
2628165147 has 8 divisors (see below), whose sum is σ = 3505308480. Its totient is φ = 1751565960.
The previous prime is 2628165103. The next prime is 2628165191. The reversal of 2628165147 is 7415618262.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (2628165103) and next prime (2628165191).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2628165147 - 26 = 2628165083 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2628165099 and 2628165108.
It is not an unprimeable number, because it can be changed into a prime (2628165047) 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 7 ways as a sum of consecutive naturals, for example, 124629 + ... + 144182.
It is an arithmetic number, because the mean of its divisors is an integer number (438163560).
Almost surely, 22628165147 is an apocalyptic number.
2628165147 is a deficient number, since it is larger than the sum of its proper divisors (877143333).
2628165147 is a wasteful number, since it uses less digits than its factorization.
2628165147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 272073.
The product of its digits is 161280, while the sum is 42.
The square root of 2628165147 is about 51265.6331961286. The cubic root of 2628165147 is about 1380.0163036301.
The spelling of 2628165147 in words is "two billion, six hundred twenty-eight million, one hundred sixty-five thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.024 sec. • engine limits •