Base | Representation |
---|---|
bin | 1010010010000110… |
… | …1000000000100101 |
3 | 21010100221122122111 |
4 | 2210201220000211 |
5 | 21123112344203 |
6 | 1133522201021 |
7 | 125254655611 |
oct | 24441500045 |
9 | 7110848574 |
10 | 2760278053 |
11 | 1197117835 |
12 | 6504b3171 |
13 | 34cb30130 |
14 | 1c2844341 |
15 | 1124e026d |
hex | a4868025 |
2760278053 has 8 divisors (see below), whose sum is σ = 2973120248. Its totient is φ = 2547509184.
The previous prime is 2760278051. The next prime is 2760278069. The reversal of 2760278053 is 3508720672.
It can be written as a sum of positive squares in 4 ways, for example, as 1111755649 + 1648522404 = 33343^2 + 40602^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 2760278053 - 21 = 2760278051 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2760277997 and 2760278015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2760278051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 79051 + ... + 108487.
It is an arithmetic number, because the mean of its divisors is an integer number (371640031).
Almost surely, 22760278053 is an apocalyptic number.
It is an amenable number.
2760278053 is a deficient number, since it is larger than the sum of its proper divisors (212842195).
2760278053 is a wasteful number, since it uses less digits than its factorization.
2760278053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36663.
The product of its (nonzero) digits is 141120, while the sum is 40.
The square root of 2760278053 is about 52538.3484038088. The cubic root of 2760278053 is about 1402.7629201110.
The spelling of 2760278053 in words is "two billion, seven hundred sixty million, two hundred seventy-eight thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •