Base | Representation |
---|---|
bin | 11001010000110001110… |
… | …10000110100001101101 |
3 | 10001222110111112120210202 |
4 | 30220120322012201231 |
5 | 103210131311344221 |
6 | 1502430531443245 |
7 | 116465611062011 |
oct | 14503072064155 |
9 | 3058414476722 |
10 | 868001278061 |
11 | 305132102455 |
12 | 120283a56525 |
13 | 63b102a6608 |
14 | 30023736541 |
15 | 178a31e3d0b |
hex | ca18e8686d |
868001278061 has 8 divisors (see below), whose sum is σ = 877786356600. Its totient is φ = 858216916480.
The previous prime is 868001278021. The next prime is 868001278097. The reversal of 868001278061 is 160872100868.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 26022529225 + 841978748836 = 161315^2 + 917594^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 868001278061 - 238 = 593123371117 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 868001277997 and 868001278015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (868001278021) 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, 2476181 + ... + 2804901.
It is an arithmetic number, because the mean of its divisors is an integer number (109723294575).
Almost surely, 2868001278061 is an apocalyptic number.
It is an amenable number.
868001278061 is a deficient number, since it is larger than the sum of its proper divisors (9785078539).
868001278061 is a wasteful number, since it uses less digits than its factorization.
868001278061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 358479.
The product of its (nonzero) digits is 258048, while the sum is 47.
The spelling of 868001278061 in words is "eight hundred sixty-eight billion, one million, two hundred seventy-eight thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •