Base | Representation |
---|---|
bin | 10011101111111011001010… |
… | …110000000111000001111001 |
3 | 102101112101010000200221120012 |
4 | 103233323022300013001321 |
5 | 42341023024422102144 |
6 | 504421111253511305 |
7 | 24203104232621153 |
oct | 2357731260070171 |
9 | 371471100627505 |
10 | 86856230269049 |
11 | 2574757a71671a |
12 | 98a939b942535 |
13 | 39606798cba17 |
14 | 1763c14a69ad3 |
15 | a094e34c8e9e |
hex | 4efecac07079 |
86856230269049 has 2 divisors, whose sum is σ = 86856230269050. Its totient is φ = 86856230269048.
The previous prime is 86856230268947. The next prime is 86856230269051. The reversal of 86856230269049 is 94096203265868.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 85012880979049 + 1843349290000 = 9220243^2 + 1357700^2 .
It is a cyclic number.
It is not a de Polignac number, because 86856230269049 - 212 = 86856230264953 is a prime.
Together with 86856230269051, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 86856230269049.
It is not a weakly prime, because it can be changed into another prime (86856230269849) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 43428115134524 + 43428115134525.
It is an arithmetic number, because the mean of its divisors is an integer number (43428115134525).
Almost surely, 286856230269049 is an apocalyptic number.
It is an amenable number.
86856230269049 is a deficient number, since it is larger than the sum of its proper divisors (1).
86856230269049 is an equidigital number, since it uses as much as digits as its factorization.
86856230269049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 268738560, while the sum is 68.
The spelling of 86856230269049 in words is "eighty-six trillion, eight hundred fifty-six billion, two hundred thirty million, two hundred sixty-nine thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •