Base | Representation |
---|---|
bin | 1000011100101000011100… |
… | …1101001001011000010001 |
3 | 1012212220220211101222110222 |
4 | 2013022013031021120101 |
5 | 2204133244320230101 |
6 | 31430502001402425 |
7 | 1646014664346215 |
oct | 207120715113021 |
9 | 35786824358428 |
10 | 9287987664401 |
11 | 2a61016998946 |
12 | 10600a8339415 |
13 | 524b131280c4 |
14 | 241780718945 |
15 | 1119064d001b |
hex | 87287349611 |
9287987664401 has 8 divisors (see below), whose sum is σ = 9858864425544. Its totient is φ = 8719835852800.
The previous prime is 9287987664343. The next prime is 9287987664443. The reversal of 9287987664401 is 1044667897829.
It is a Cunningham number, because it is equal to 30476202+1.
It can be written as a sum of positive squares in 4 ways, for example, as 7231129733776 + 2056857930625 = 2689076^2 + 1434175^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 9287987664401 - 26 = 9287987664337 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (9287987664491) 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, 681230360 + ... + 681243993.
It is an arithmetic number, because the mean of its divisors is an integer number (1232358053193).
Almost surely, 29287987664401 is an apocalyptic number.
It is an amenable number.
9287987664401 is a deficient number, since it is larger than the sum of its proper divisors (570876761143).
9287987664401 is a wasteful number, since it uses less digits than its factorization.
9287987664401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1362474771.
The product of its (nonzero) digits is 292626432, while the sum is 71.
The spelling of 9287987664401 in words is "nine trillion, two hundred eighty-seven billion, nine hundred eighty-seven million, six hundred sixty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •