Base | Representation |
---|---|
bin | 10000101111010111… |
… | …00011110110100001 |
3 | 212012100001120022121 |
4 | 20113223203312201 |
5 | 121401212321401 |
6 | 4043443304241 |
7 | 435466122400 |
oct | 102753436641 |
9 | 25170046277 |
10 | 8987229601 |
11 | 38a2069689 |
12 | 18a997b081 |
13 | b02c2b74c |
14 | 61384d637 |
15 | 379007ca1 |
hex | 217ae3da1 |
8987229601 has 27 divisors (see below), whose sum is σ = 10850699379. Its totient is φ = 7421780688.
The previous prime is 8987229467. The next prime is 8987229607. The reversal of 8987229601 is 1069227898.
The square root of 8987229601 is 94801.
It is a perfect power (a square), and thus also a powerful number.
8987229601 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 4712685201 + 4274544400 = 68649^2 + 65380^2 .
It is not a de Polignac number, because 8987229601 - 215 = 8987196833 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (8987229607) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 19244370 + ... + 19244836.
Almost surely, 28987229601 is an apocalyptic number.
8987229601 is the 94801-st square number.
8987229601 is the 47401-st centered octagonal number.
It is an amenable number.
8987229601 is a deficient number, since it is larger than the sum of its proper divisors (1863469778).
8987229601 is an frugal number, since it uses more digits than its factorization.
8987229601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1006 (or 503 counting only the distinct ones).
The product of its (nonzero) digits is 870912, while the sum is 52.
The cubic root of 8987229601 is about 2079.0995240063.
The spelling of 8987229601 in words is "eight billion, nine hundred eighty-seven million, two hundred twenty-nine thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •