Base | Representation |
---|---|
bin | 1010010101100111… |
… | …0010010011011101 |
3 | 21011101122121202100 |
4 | 2211121302103131 |
5 | 21140400002120 |
6 | 1135205515313 |
7 | 125524053561 |
oct | 24531622335 |
9 | 7141577670 |
10 | 2775000285 |
11 | 11a4462872 |
12 | 655412b39 |
13 | 352bb6205 |
14 | 1c47976a1 |
15 | 11394c490 |
hex | a56724dd |
2775000285 has 48 divisors (see below), whose sum is σ = 4984939440. Its totient is φ = 1426360320.
The previous prime is 2775000251. The next prime is 2775000289. The reversal of 2775000285 is 5820005772.
2775000285 is a `hidden beast` number, since 2 + 77 + 500 + 0 + 2 + 85 = 666.
It can be written as a sum of positive squares in 8 ways, for example, as 294362649 + 2480637636 = 17157^2 + 49806^2 .
It is not a de Polignac number, because 2775000285 - 27 = 2775000157 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2775000289) 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 47 ways as a sum of consecutive naturals, for example, 860997 + ... + 864213.
It is an arithmetic number, because the mean of its divisors is an integer number (103852905).
Almost surely, 22775000285 is an apocalyptic number.
It is an amenable number.
2775000285 is a deficient number, since it is larger than the sum of its proper divisors (2209939155).
2775000285 is a wasteful number, since it uses less digits than its factorization.
2775000285 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3918 (or 3915 counting only the distinct ones).
The product of its (nonzero) digits is 39200, while the sum is 36.
The square root of 2775000285 is about 52678.2714693639. The cubic root of 2775000285 is about 1405.2524269630.
The spelling of 2775000285 in words is "two billion, seven hundred seventy-five million, two hundred eighty-five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •