Base | Representation |
---|---|
bin | 10011100110111000010001… |
… | …011101001001000000000000 |
3 | 102022022221200202122122010120 |
4 | 103212320101131021000000 |
5 | 42300332023413031200 |
6 | 503223352150300240 |
7 | 24110150631444600 |
oct | 2346702135110000 |
9 | 368287622578116 |
10 | 86234646220800 |
11 | 255279a9728220 |
12 | 9808a28657680 |
13 | 3916b7a35773c |
14 | 1741ac9d9cc00 |
15 | 9e82637e29a0 |
hex | 4e6e11749000 |
86234646220800 has 1872 divisors, whose sum is σ = 363484393170624. Its totient is φ = 17836277760000.
The previous prime is 86234646220783. The next prime is 86234646220819. The reversal of 86234646220800 is 802264643268.
It is an unprimeable number.
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 143 ways as a sum of consecutive naturals, for example, 39904971720 + ... + 39904973880.
Almost surely, 286234646220800 is an apocalyptic number.
86234646220800 is a gapful number since it is divisible by the number (80) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 86234646220800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (181742196585312).
86234646220800 is an abundant number, since it is smaller than the sum of its proper divisors (277249746949824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
86234646220800 is a wasteful number, since it uses less digits than its factorization.
86234646220800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2464 (or 2430 counting only the distinct ones).
The product of its (nonzero) digits is 5308416, while the sum is 51.
The spelling of 86234646220800 in words is "eighty-six trillion, two hundred thirty-four billion, six hundred forty-six million, two hundred twenty thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •