Base | Representation |
---|---|
bin | 1001001011101100100110… |
… | …0110111001111000111001 |
3 | 1022202012222022120010222122 |
4 | 2102323021212321320321 |
5 | 2310410221211031401 |
6 | 33250143225531025 |
7 | 2061311026165142 |
oct | 222731146717071 |
9 | 38665868503878 |
10 | 10096555564601 |
11 | 3242a1a4438a0 |
12 | 1170944043a75 |
13 | 5831411847bc |
14 | 26c966936ac9 |
15 | 12797ba9921b |
hex | 92ec99b9e39 |
10096555564601 has 32 divisors (see below), whose sum is σ = 11286864141696. Its totient is φ = 8954862336000.
The previous prime is 10096555564493. The next prime is 10096555564631. The reversal of 10096555564601 is 10646555569001.
It is a cyclic number.
It is not a de Polignac number, because 10096555564601 - 226 = 10096488455737 is a prime.
It is a Smith number, since the sum of its digits (53) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (10096555564631) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 30749786 + ... + 31076396.
It is an arithmetic number, because the mean of its divisors is an integer number (352714504428).
Almost surely, 210096555564601 is an apocalyptic number.
10096555564601 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10096555564601 is a deficient number, since it is larger than the sum of its proper divisors (1190308577095).
10096555564601 is a wasteful number, since it uses less digits than its factorization.
10096555564601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 327113.
The product of its (nonzero) digits is 4860000, while the sum is 53.
The spelling of 10096555564601 in words is "ten trillion, ninety-six billion, five hundred fifty-five million, five hundred sixty-four thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •