Base | Representation |
---|---|
bin | 101000000111110111… |
… | …1110110111110010101 |
3 | 22020101212220212020100 |
4 | 1100033233312332111 |
5 | 2402430332100401 |
6 | 103325531524313 |
7 | 6140133043266 |
oct | 1201757667625 |
9 | 266355825210 |
10 | 86163550101 |
11 | 335a6094542 |
12 | 14847bb9699 |
13 | 8182065195 |
14 | 425559c96d |
15 | 2394660b86 |
hex | 140fbf6f95 |
86163550101 has 12 divisors (see below), whose sum is σ = 124620315820. Its totient is φ = 57367664640.
The previous prime is 86163550093. The next prime is 86163550117. The reversal of 86163550101 is 10105536168.
86163550101 is a `hidden beast` number, since 8 + 6 + 1 + 635 + 5 + 0 + 10 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 43459740900 + 42703809201 = 208470^2 + 206649^2 .
It is not a de Polignac number, because 86163550101 - 23 = 86163550093 is a prime.
It is a super-2 number, since 2×861635501012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (86163550171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6217870 + ... + 6231711.
Almost surely, 286163550101 is an apocalyptic number.
It is an amenable number.
86163550101 is a deficient number, since it is larger than the sum of its proper divisors (38456765719).
86163550101 is a wasteful number, since it uses less digits than its factorization.
86163550101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12450356 (or 12450353 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 36.
The spelling of 86163550101 in words is "eighty-six billion, one hundred sixty-three million, five hundred fifty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •