Base | Representation |
---|---|
bin | 1010101011011111… |
… | …1101101000011001 |
3 | 21101210101101021200 |
4 | 2222313331220121 |
5 | 21332400001311 |
6 | 1152245224413 |
7 | 131020241661 |
oct | 25267755031 |
9 | 7353341250 |
10 | 2866797081 |
11 | 1241261095 |
12 | 680102109 |
13 | 368c16c45 |
14 | 1d2a511a1 |
15 | 11ba31556 |
hex | aadfda19 |
2866797081 has 6 divisors (see below), whose sum is σ = 4140929130. Its totient is φ = 1911198048.
The previous prime is 2866797049. The next prime is 2866797097. The reversal of 2866797081 is 1807976682.
It can be written as a sum of positive squares in only one way, i.e., 2770443225 + 96353856 = 52635^2 + 9816^2 .
It is not a de Polignac number, because 2866797081 - 25 = 2866797049 is a prime.
It is a super-2 number, since 2×28667970812 = 16437051007260241122, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2866793081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 159266496 + ... + 159266513.
It is an arithmetic number, because the mean of its divisors is an integer number (690154855).
Almost surely, 22866797081 is an apocalyptic number.
It is an amenable number.
2866797081 is a deficient number, since it is larger than the sum of its proper divisors (1274132049).
2866797081 is a wasteful number, since it uses less digits than its factorization.
2866797081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 318533015 (or 318533012 counting only the distinct ones).
The product of its (nonzero) digits is 2032128, while the sum is 54.
The square root of 2866797081 is about 53542.4792197746. The cubic root of 2866797081 is about 1420.5798532808.
The spelling of 2866797081 in words is "two billion, eight hundred sixty-six million, seven hundred ninety-seven thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •