Base | Representation |
---|---|
bin | 101000110011111011… |
… | …0001111101110110101 |
3 | 22101012220011120010000 |
4 | 1101213312033232311 |
5 | 2413442223310011 |
6 | 104132332021513 |
7 | 6221561321211 |
oct | 1214766175665 |
9 | 271186146100 |
10 | 87641619381 |
11 | 341944558a8 |
12 | 14b9b001899 |
13 | 83593492a4 |
14 | 43559d3941 |
15 | 242e2c7356 |
hex | 1467d8fbb5 |
87641619381 has 10 divisors (see below), whose sum is σ = 130921431542. Its totient is φ = 58427746200.
The previous prime is 87641619361. The next prime is 87641619391. The reversal of 87641619381 is 18391614678.
It can be written as a sum of positive squares in only one way, i.e., 87222762225 + 418857156 = 295335^2 + 20466^2 .
It is not a de Polignac number, because 87641619381 - 210 = 87641618357 is a prime.
It is a super-2 number, since 2×876416193812 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (87641619361) by changing a digit.
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 9 ways as a sum of consecutive naturals, for example, 540997570 + ... + 540997731.
Almost surely, 287641619381 is an apocalyptic number.
87641619381 is a gapful number since it is divisible by the number (81) formed by its first and last digit.
It is an amenable number.
87641619381 is a deficient number, since it is larger than the sum of its proper divisors (43279812161).
87641619381 is a wasteful number, since it uses less digits than its factorization.
87641619381 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1081995313 (or 1081995304 counting only the distinct ones).
The product of its digits is 1741824, while the sum is 54.
The spelling of 87641619381 in words is "eighty-seven billion, six hundred forty-one million, six hundred nineteen thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •