Base | Representation |
---|---|
bin | 10011110010011000101110… |
… | …110111100001001110001000 |
3 | 102102010112210201002120012120 |
4 | 103302120232313201032020 |
5 | 42401311021344014410 |
6 | 505030531221011240 |
7 | 24221243606655444 |
oct | 2362305667411610 |
9 | 372115721076176 |
10 | 87025413657480 |
11 | 258022a82974a1 |
12 | 9916136b53b20 |
13 | 39735cc607b9c |
14 | 176c0a4091824 |
15 | a0dae62ba570 |
hex | 4f262ede1388 |
87025413657480 has 64 divisors (see below), whose sum is σ = 261142054410240. Its totient is φ = 23200926892032.
The previous prime is 87025413657461. The next prime is 87025413657499. The reversal of 87025413657480 is 8475631452078.
It is an interprime number because it is at equal distance from previous prime (87025413657461) and next prime (87025413657499).
It is a Harshad number since it is a multiple of its sum of digits (60).
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 90929529 + ... + 91881608.
It is an arithmetic number, because the mean of its divisors is an integer number (4080344600160).
Almost surely, 287025413657480 is an apocalyptic number.
It is an amenable number.
87025413657480 is an abundant number, since it is smaller than the sum of its proper divisors (174116640752760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
87025413657480 is a wasteful number, since it uses less digits than its factorization.
87025413657480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 182815118 (or 182815114 counting only the distinct ones).
The product of its (nonzero) digits is 45158400, while the sum is 60.
The spelling of 87025413657480 in words is "eighty-seven trillion, twenty-five billion, four hundred thirteen million, six hundred fifty-seven thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •