Base | Representation |
---|---|
bin | 1000011110111000… |
… | …1111001110001000 |
3 | 12212200122212200202 |
4 | 2013232033032020 |
5 | 14130410421003 |
6 | 1013540551332 |
7 | 110266364351 |
oct | 20756171610 |
9 | 5780585622 |
10 | 2277045128 |
11 | a69372786 |
12 | 5366b2548 |
13 | 2a3998aa7 |
14 | 1785b4d28 |
15 | d4d8a088 |
hex | 87b8f388 |
2277045128 has 12 divisors (see below), whose sum is σ = 4269712695. Its totient is φ = 1138455080.
The previous prime is 2277045109. The next prime is 2277045131. The reversal of 2277045128 is 8215407722.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
2277045128 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 1138522564 + 1138522564 = 33742^2 + 33742^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=33742.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2277045091 and 2277045100.
It is an unprimeable number.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 126533 + ... + 143403.
Almost surely, 22277045128 is an apocalyptic number.
It is an amenable number.
2277045128 is a deficient number, since it is larger than the sum of its proper divisors (1992667567).
2277045128 is an frugal number, since it uses more digits than its factorization.
2277045128 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33748 (or 16873 counting only the distinct ones).
The product of its (nonzero) digits is 62720, while the sum is 38.
The square root of 2277045128 is about 47718.3940215930. The cubic root of 2277045128 is about 1315.6000438301.
The spelling of 2277045128 in words is "two billion, two hundred seventy-seven million, forty-five thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •