Base | Representation |
---|---|
bin | 10011100110110001111011… |
… | …010010001000111011100000 |
3 | 102022022022002212002112122010 |
4 | 103212301323102020323200 |
5 | 42300224044414142412 |
6 | 503220304041312520 |
7 | 24106520024636412 |
oct | 2346617322107340 |
9 | 368268085075563 |
10 | 86227831787232 |
11 | 255250220a8443 |
12 | 9807646495740 |
13 | 3916332624225 |
14 | 1741640d489b2 |
15 | 9e7eb543133c |
hex | 4e6c7b488ee0 |
86227831787232 has 48 divisors (see below), whose sum is σ = 228681543604752. Its totient is φ = 28446295019520.
The previous prime is 86227831787231. The next prime is 86227831787261. The reversal of 86227831787232 is 23278713872268.
It is a tau number, because it is divible by the number of its divisors (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (86227831787231) 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 7 ways as a sum of consecutive naturals, for example, 4629921519 + ... + 4629940142.
It is an arithmetic number, because the mean of its divisors is an integer number (4764198825099).
Almost surely, 286227831787232 is an apocalyptic number.
It is an amenable number.
86227831787232 is an abundant number, since it is smaller than the sum of its proper divisors (142453711817520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
86227831787232 is a wasteful number, since it uses less digits than its factorization.
86227831787232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9259861771 (or 9259861763 counting only the distinct ones).
The product of its digits is 151732224, while the sum is 66.
The spelling of 86227831787232 in words is "eighty-six trillion, two hundred twenty-seven billion, eight hundred thirty-one million, seven hundred eighty-seven thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •