Base | Representation |
---|---|
bin | 11111111001101010100… |
… | …00001111100011110001 |
3 | 10212210020210112221010100 |
4 | 33330311100033203301 |
5 | 120424313142022321 |
6 | 2155313535423013 |
7 | 142122426134115 |
oct | 17746520174361 |
9 | 3783223487110 |
10 | 1096110110961 |
11 | 392948644868 |
12 | 158525084a69 |
13 | 7c493c2a598 |
14 | 3b0a2a17745 |
15 | 1d7a422b326 |
hex | ff3540f8f1 |
1096110110961 has 12 divisors (see below), whose sum is σ = 1586689756288. Its totient is φ = 729161798904.
The previous prime is 1096110110947. The next prime is 1096110110983. The reversal of 1096110110961 is 1690110116901.
It is not a de Polignac number, because 1096110110961 - 26 = 1096110110897 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1096110110861) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 131518525 + ... + 131526858.
Almost surely, 21096110110961 is an apocalyptic number.
It is an amenable number.
1096110110961 is a deficient number, since it is larger than the sum of its proper divisors (490579645327).
1096110110961 is a wasteful number, since it uses less digits than its factorization.
1096110110961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 263045852 (or 263045849 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 36.
The spelling of 1096110110961 in words is "one trillion, ninety-six billion, one hundred ten million, one hundred ten thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •