Base | Representation |
---|---|
bin | 1001000101110110100100… |
… | …0001010111111010011001 |
3 | 1022101121210221101222000121 |
4 | 2101131221001113322121 |
5 | 2302234104110144221 |
6 | 33132100204433241 |
7 | 2051124636264100 |
oct | 221355101277231 |
9 | 38347727358017 |
10 | 9996150865561 |
11 | 3204386623383 |
12 | 11553a2848821 |
13 | 57682c879993 |
14 | 267b5dc4b037 |
15 | 12505206da41 |
hex | 91769057e99 |
9996150865561 has 9 divisors (see below), whose sum is σ = 11628201241749. Its totient is φ = 8568110343324.
The previous prime is 9996150865549. The next prime is 9996150865601. The reversal of 9996150865561 is 1655680516999.
The square root of 9996150865561 is 3161669.
It is a perfect power (a square), and thus also a powerful number.
9996150865561 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 9996150865561 - 217 = 9996150734489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (9996150865511) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 21905850 + ... + 22357516.
Almost surely, 29996150865561 is an apocalyptic number.
9996150865561 is the 3161669-th square number.
9996150865561 is the 1580835-th centered octagonal number.
It is an amenable number.
9996150865561 is a deficient number, since it is larger than the sum of its proper divisors (1632050376188).
9996150865561 is an frugal number, since it uses more digits than its factorization.
9996150865561 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 903348 (or 451674 counting only the distinct ones).
The product of its (nonzero) digits is 157464000, while the sum is 70.
The spelling of 9996150865561 in words is "nine trillion, nine hundred ninety-six billion, one hundred fifty million, eight hundred sixty-five thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •