Base | Representation |
---|---|
bin | 101000100000110101… |
… | …1010000100100011101 |
3 | 22022120021010010202122 |
4 | 1101001223100210131 |
5 | 2411134302030041 |
6 | 103545013432325 |
7 | 6166654020023 |
oct | 1210153204435 |
9 | 268507103678 |
10 | 87001205021 |
11 | 33995a04035 |
12 | 14a4063b6a5 |
13 | 8286770393 |
14 | 42d492a713 |
15 | 23e2e74c4b |
hex | 1441ad091d |
87001205021 has 8 divisors (see below), whose sum is σ = 87503993304. Its totient is φ = 86498660160.
The previous prime is 87001205009. The next prime is 87001205087. The reversal of 87001205021 is 12050210078.
It can be written as a sum of positive squares in 4 ways, for example, as 7742064121 + 79259140900 = 87989^2 + 281530^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-87001205021 is a prime.
It is a super-2 number, since 2×870012050212 (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 (87001205321) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 682115 + ... + 799551.
It is an arithmetic number, because the mean of its divisors is an integer number (10937999163).
Almost surely, 287001205021 is an apocalyptic number.
It is an amenable number.
87001205021 is a deficient number, since it is larger than the sum of its proper divisors (502788283).
87001205021 is a wasteful number, since it uses less digits than its factorization.
87001205021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121711.
The product of its (nonzero) digits is 1120, while the sum is 26.
Adding to 87001205021 its reverse (12050210078), we get a palindrome (99051415099).
The spelling of 87001205021 in words is "eighty-seven billion, one million, two hundred five thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •