Base | Representation |
---|---|
bin | 11001010001101010100… |
… | …01001001111000101101 |
3 | 10002000200122211222201121 |
4 | 30220311101021320231 |
5 | 103212120113130211 |
6 | 1502550045540541 |
7 | 116513446255651 |
oct | 14506521117055 |
9 | 3060618758647 |
10 | 868477083181 |
11 | 305356743924 |
12 | 120397274751 |
13 | 63b87a39ac6 |
14 | 3006a9d0a61 |
15 | 178ced7d271 |
hex | ca35449e2d |
868477083181 has 2 divisors, whose sum is σ = 868477083182. Its totient is φ = 868477083180.
The previous prime is 868477083179. The next prime is 868477083197. The reversal of 868477083181 is 181380774868.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 692839816900 + 175637266281 = 832370^2 + 419091^2 .
It is a cyclic number.
It is not a de Polignac number, because 868477083181 - 21 = 868477083179 is a prime.
It is a super-2 number, since 2×8684770831812 (a number of 25 digits) contains 22 as substring.
Together with 868477083179, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (868477083151) 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 as a sum of consecutive naturals, namely, 434238541590 + 434238541591.
It is an arithmetic number, because the mean of its divisors is an integer number (434238541591).
Almost surely, 2868477083181 is an apocalyptic number.
It is an amenable number.
868477083181 is a deficient number, since it is larger than the sum of its proper divisors (1).
868477083181 is an equidigital number, since it uses as much as digits as its factorization.
868477083181 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14450688, while the sum is 61.
The spelling of 868477083181 in words is "eight hundred sixty-eight billion, four hundred seventy-seven million, eighty-three thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •