Base | Representation |
---|---|
bin | 101000100011111100… |
… | …0111110111110011111 |
3 | 22022211112022011022102 |
4 | 1101013320332332133 |
5 | 2411342444410041 |
6 | 104003220235315 |
7 | 6202361150465 |
oct | 1210770767637 |
9 | 268745264272 |
10 | 87105466271 |
11 | 33a3984605a |
12 | 14a6b53bb3b |
13 | 82a2246625 |
14 | 430470a835 |
15 | 23ec1bc09b |
hex | 1447e3ef9f |
87105466271 has 4 divisors (see below), whose sum is σ = 88958774112. Its totient is φ = 85252158432.
The previous prime is 87105466241. The next prime is 87105466319. The reversal of 87105466271 is 17266450178.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 17266450178 = 2 ⋅8633225089.
It is a cyclic number.
It is not a de Polignac number, because 87105466271 - 210 = 87105465247 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (47), and also a Moran number because the ratio is a prime number: 1853307793 = 87105466271 / (8 + 7 + 1 + 0 + 5 + 4 + 6 + 6 + 2 + 7 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (87105466241) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 926653850 + ... + 926653943.
It is an arithmetic number, because the mean of its divisors is an integer number (22239693528).
Almost surely, 287105466271 is an apocalyptic number.
87105466271 is a deficient number, since it is larger than the sum of its proper divisors (1853307841).
87105466271 is a wasteful number, since it uses less digits than its factorization.
87105466271 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1853307840.
The product of its (nonzero) digits is 564480, while the sum is 47.
The spelling of 87105466271 in words is "eighty-seven billion, one hundred five million, four hundred sixty-six thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •