Base | Representation |
---|---|
bin | 101000110000000000… |
… | …1101110111110101111 |
3 | 22100212202021121002222 |
4 | 1101200001232332233 |
5 | 2413210131210411 |
6 | 104111323505555 |
7 | 6215406145043 |
oct | 1214001567657 |
9 | 270782247088 |
10 | 87510413231 |
11 | 3412738a76a |
12 | 14b630882bb |
13 | 83380ca807 |
14 | 43423dc023 |
15 | 2422a0b4db |
hex | 146006efaf |
87510413231 has 4 divisors (see below), whose sum is σ = 87531871200. Its totient is φ = 87488955264.
The previous prime is 87510413197. The next prime is 87510413233. The reversal of 87510413231 is 13231401578.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-87510413231 is a prime.
It is a super-2 number, since 2×875104132312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 87510413191 and 87510413200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (87510413233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10722866 + ... + 10731023.
It is an arithmetic number, because the mean of its divisors is an integer number (21882967800).
Almost surely, 287510413231 is an apocalyptic number.
87510413231 is a deficient number, since it is larger than the sum of its proper divisors (21457969).
87510413231 is a wasteful number, since it uses less digits than its factorization.
87510413231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21457968.
The product of its (nonzero) digits is 20160, while the sum is 35.
The spelling of 87510413231 in words is "eighty-seven billion, five hundred ten million, four hundred thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •