Base | Representation |
---|---|
bin | 10011110010011001001011… |
… | …000010111011101000000100 |
3 | 102102010121000122122221111010 |
4 | 103302121023002323220010 |
5 | 42401313003410130033 |
6 | 505031050145442220 |
7 | 24221261410213410 |
oct | 2362311302735004 |
9 | 372117018587433 |
10 | 87025886411268 |
11 | 25802520134402 |
12 | 9916249340370 |
13 | 397367654055c |
14 | 176c10ab93d40 |
15 | a0db22a50863 |
hex | 4f264b0bba04 |
87025886411268 has 288 divisors, whose sum is σ = 243184740728832. Its totient is φ = 23702645433600.
The previous prime is 87025886411203. The next prime is 87025886411297. The reversal of 87025886411268 is 86211468852078.
It is a junction number, because it is equal to n+sod(n) for n = 87025886411199 and 87025886411208.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 5276526430 + ... + 5276542922.
It is an arithmetic number, because the mean of its divisors is an integer number (844391460864).
Almost surely, 287025886411268 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 87025886411268, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (121592370364416).
87025886411268 is an abundant number, since it is smaller than the sum of its proper divisors (156158854317564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
87025886411268 is a wasteful number, since it uses less digits than its factorization.
87025886411268 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16935 (or 16830 counting only the distinct ones).
The product of its (nonzero) digits is 82575360, while the sum is 66.
The spelling of 87025886411268 in words is "eighty-seven trillion, twenty-five billion, eight hundred eighty-six million, four hundred eleven thousand, two hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •