Base | Representation |
---|---|
bin | 101000000100011010… |
… | …0011110101011000000 |
3 | 22020002210012210120020 |
4 | 1100020310132223000 |
5 | 2402211103231033 |
6 | 103310220413440 |
7 | 6134222105253 |
oct | 1201064365300 |
9 | 266083183506 |
10 | 86047320768 |
11 | 33546518742 |
12 | 148150a7280 |
13 | 8163c5b626 |
14 | 4243d8509a |
15 | 23893526b3 |
hex | 1408d1eac0 |
86047320768 has 448 divisors, whose sum is σ = 260187033600. Its totient is φ = 24958402560.
The previous prime is 86047320767. The next prime is 86047320791. The reversal of 86047320768 is 86702374068.
It is a super-2 number, since 2×860473207682 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a self number, because there is not a number n which added to its sum of digits gives 86047320768.
It is not an unprimeable number, because it can be changed into a prime (86047320767) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 276679333 + ... + 276679643.
Almost surely, 286047320768 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 86047320768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (130093516800).
86047320768 is an abundant number, since it is smaller than the sum of its proper divisors (174139712832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
86047320768 is a wasteful number, since it uses less digits than its factorization.
86047320768 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 488 (or 478 counting only the distinct ones).
The product of its (nonzero) digits is 2709504, while the sum is 51.
The spelling of 86047320768 in words is "eighty-six billion, forty-seven million, three hundred twenty thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •