Base | Representation |
---|---|
bin | 11001010010010110111… |
… | …01111000101000111001 |
3 | 10002001122121122200211210 |
4 | 30221023131320220321 |
5 | 103213400434103121 |
6 | 1503051032313333 |
7 | 116525621026101 |
oct | 14511335705071 |
9 | 3061577580753 |
10 | 868849519161 |
11 | 3055279a2558 |
12 | 12047bb42849 |
13 | 63c16c4a120 |
14 | 300a425c201 |
15 | 179028e9876 |
hex | ca4b778a39 |
868849519161 has 16 divisors (see below), whose sum is σ = 1247619142784. Its totient is φ = 534659336064.
The previous prime is 868849519123. The next prime is 868849519177. The reversal of 868849519161 is 161915948868.
It is not a de Polignac number, because 868849519161 - 27 = 868849519033 is a prime.
It is a super-2 number, since 2×8688495191612 (a number of 25 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (66) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 868849519092 and 868849519101.
It is not an unprimeable number, because it can be changed into a prime (868849514161) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 918660 + ... + 1606746.
It is an arithmetic number, because the mean of its divisors is an integer number (77976196424).
Almost surely, 2868849519161 is an apocalyptic number.
It is an amenable number.
868849519161 is a deficient number, since it is larger than the sum of its proper divisors (378769623623).
868849519161 is a wasteful number, since it uses less digits than its factorization.
868849519161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 720480.
The product of its digits is 29859840, while the sum is 66.
The spelling of 868849519161 in words is "eight hundred sixty-eight billion, eight hundred forty-nine million, five hundred nineteen thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •