Base | Representation |
---|---|
bin | 101000010001001010100… |
… | …000011101010000011001 |
3 | 100210112122112212012220121 |
4 | 220101022200131100121 |
5 | 330314220443223144 |
6 | 5515123243353241 |
7 | 403632006034321 |
oct | 50211240352031 |
9 | 10715575765817 |
10 | 2767208961049 |
11 | 977626354695 |
12 | 388378822821 |
13 | 170c3cb38400 |
14 | 97d0dc3a281 |
15 | 4beac62b384 |
hex | 2844a81d419 |
2767208961049 has 27 divisors (see below), whose sum is σ = 3072296167767. Its totient is φ = 2491247116800.
The previous prime is 2767208961017. The next prime is 2767208961061. The reversal of 2767208961049 is 9401698027672.
The square root of 2767208961049 is 1663493.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 13 ways, for example, as 990671855625 + 1776537105424 = 995325^2 + 1332868^2 .
It is not a de Polignac number, because 2767208961049 - 25 = 2767208961017 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2767208961079) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 886640209 + ... + 886643329.
Almost surely, 22767208961049 is an apocalyptic number.
2767208961049 is the 1663493-rd square number.
2767208961049 is the 831747-th centered octagonal number.
It is an amenable number.
2767208961049 is a deficient number, since it is larger than the sum of its proper divisors (305087206718).
2767208961049 is an frugal number, since it uses more digits than its factorization.
2767208961049 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6350 (or 3175 counting only the distinct ones).
The product of its (nonzero) digits is 18289152, while the sum is 61.
The spelling of 2767208961049 in words is "two trillion, seven hundred sixty-seven billion, two hundred eight million, nine hundred sixty-one thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •