Base | Representation |
---|---|
bin | 110100101011… |
… | …1011010100100 |
3 | 1220222021221001 |
4 | 1221113122210 |
5 | 24032333103 |
6 | 2424003044 |
7 | 453526531 |
oct | 151273244 |
9 | 56867831 |
10 | 27621028 |
11 | 146560a6 |
12 | 9300484 |
13 | 5951206 |
14 | 394dd88 |
15 | 265901d |
hex | 1a576a4 |
27621028 has 12 divisors (see below), whose sum is σ = 48395340. Its totient is φ = 13793792.
The previous prime is 27621019. The next prime is 27621043. The reversal of 27621028 is 82012672.
27621028 is a nontrivial binomial coefficient, being equal to C(7433, 2).
It can be written as a sum of positive squares in 2 ways, for example, as 1016064 + 26604964 = 1008^2 + 5158^2 .
It is a junction number, because it is equal to n+sod(n) for n = 27620987 and 27621005.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1 + ... + 7432.
It is an arithmetic number, because the mean of its divisors is an integer number (4032945).
Almost surely, 227621028 is an apocalyptic number.
27621028 is the 7432-nd triangular number.
27621028 is the 2478-th centered nonagonal number.
It is an amenable number.
27621028 is a deficient number, since it is larger than the sum of its proper divisors (20774312).
27621028 is a wasteful number, since it uses less digits than its factorization.
27621028 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8366 (or 8364 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 28.
The square root of 27621028 is about 5255.5711392769. The cubic root of 27621028 is about 302.2826907273.
It can be divided in two parts, 27 and 621028, that added together give a triangular number (621055 = T1114).
The spelling of 27621028 in words is "twenty-seven million, six hundred twenty-one thousand, twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •