Base | Representation |
---|---|
bin | 10011111000111001111011… |
… | …110000000001100000101000 |
3 | 102110201101002021001120010220 |
4 | 103320321323300001200220 |
5 | 42431130440303341000 |
6 | 510012414401210040 |
7 | 24265512622140204 |
oct | 2370717360014050 |
9 | 373641067046126 |
10 | 87473380137000 |
11 | 2596528572a900 |
12 | 9988b16030920 |
13 | 39a6920603390 |
14 | 1785a3c881b04 |
15 | a1a5b3c741a0 |
hex | 4f8e7bc01828 |
87473380137000 has 1536 divisors, whose sum is σ = 335050389273600. Its totient is φ = 18851374080000.
The previous prime is 87473380136939. The next prime is 87473380137037. The reversal of 87473380137000 is 73108337478.
It is a happy number.
It is a super-2 number, since 2×874733801370002 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 383 ways as a sum of consecutive naturals, for example, 90458510517 + ... + 90458511483.
It is an arithmetic number, because the mean of its divisors is an integer number (218131763850).
Almost surely, 287473380137000 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 87473380137000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (167525194636800).
87473380137000 is an abundant number, since it is smaller than the sum of its proper divisors (247577009136600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
87473380137000 is a wasteful number, since it uses less digits than its factorization.
87473380137000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1716 (or 1691 counting only the distinct ones).
The product of its (nonzero) digits is 2370816, while the sum is 51.
The spelling of 87473380137000 in words is "eighty-seven trillion, four hundred seventy-three billion, three hundred eighty million, one hundred thirty-seven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •