Base | Representation |
---|---|
bin | 11001000100001000010… |
… | …11101011001011101000 |
3 | 10001022221021122102022002 |
4 | 30202010023223023220 |
5 | 103102230021042133 |
6 | 1455345050550132 |
7 | 116135420446001 |
oct | 14420413531350 |
9 | 3038837572262 |
10 | 861211112168 |
11 | 302268248300 |
12 | 11aaa9a38348 |
13 | 6329a5bbb84 |
14 | 2d97b9dc1a8 |
15 | 17607027ce8 |
hex | c8842eb2e8 |
861211112168 has 48 divisors (see below), whose sum is σ = 1796298063840. Its totient is φ = 386743179680.
The previous prime is 861211112161. The next prime is 861211112171.
861211112168 is nontrivially palindromic in base 10.
It is not an unprimeable number, because it can be changed into a prime (861211112161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5279180 + ... + 5439867.
It is an arithmetic number, because the mean of its divisors is an integer number (37422876330).
Almost surely, 2861211112168 is an apocalyptic number.
861211112168 is a gapful number since it is divisible by the number (88) formed by its first and last digit.
It is an amenable number.
861211112168 is an abundant number, since it is smaller than the sum of its proper divisors (935086951672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
861211112168 is a wasteful number, since it uses less digits than its factorization.
861211112168 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10719158 (or 10719143 counting only the distinct ones).
The product of its digits is 9216, while the sum is 38.
It can be divided in two parts, 861211 and 112168, that added together give a palindrome (973379).
The spelling of 861211112168 in words is "eight hundred sixty-one billion, two hundred eleven million, one hundred twelve thousand, one hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •