Base | Representation |
---|---|
bin | 1010010000110110… |
… | …1011110100110101 |
3 | 21010000010002012201 |
4 | 2210031223310311 |
5 | 21120243111210 |
6 | 1133214144501 |
7 | 125162355043 |
oct | 24415536465 |
9 | 7100102181 |
10 | 2755050805 |
11 | 11941774a1 |
12 | 64a7b2131 |
13 | 34ba1caa0 |
14 | 1c1c83393 |
15 | 111d0b53a |
hex | a436bd35 |
2755050805 has 8 divisors (see below), whose sum is σ = 3560373432. Its totient is φ = 2034499008.
The previous prime is 2755050797. The next prime is 2755050827. The reversal of 2755050805 is 5080505572.
It can be written as a sum of positive squares in 4 ways, for example, as 5726449 + 2749324356 = 2393^2 + 52434^2 .
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 2755050805 - 23 = 2755050797 is a prime.
It is a super-2 number, since 2×27550508052 = 15180609876262296050, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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, 21192634 + ... + 21192763.
It is an arithmetic number, because the mean of its divisors is an integer number (445046679).
Almost surely, 22755050805 is an apocalyptic number.
It is an amenable number.
2755050805 is a deficient number, since it is larger than the sum of its proper divisors (805322627).
2755050805 is a wasteful number, since it uses less digits than its factorization.
2755050805 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42385415.
The product of its (nonzero) digits is 70000, while the sum is 37.
The square root of 2755050805 is about 52488.5778527100. The cubic root of 2755050805 is about 1401.8768713054.
The spelling of 2755050805 in words is "two billion, seven hundred fifty-five million, fifty thousand, eight hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •