Base | Representation |
---|---|
bin | 10000001100111001110… |
… | …100101011100110101001 |
3 | 10221102210102202111011221 |
4 | 100030321310223212221 |
5 | 121220133330003230 |
6 | 2211250143022041 |
7 | 143303156205400 |
oct | 20147164534651 |
9 | 3842712674157 |
10 | 1113366641065 |
11 | 39a1a3497298 |
12 | 15b94029a921 |
13 | 80cb410b743 |
14 | 3bc5c7d2637 |
15 | 1de641c727a |
hex | 10339d2b9a9 |
1113366641065 has 48 divisors (see below), whose sum is σ = 1586141170560. Its totient is φ = 747837968640.
The previous prime is 1113366641021. The next prime is 1113366641099. The reversal of 1113366641065 is 5601466633111.
It is not a de Polignac number, because 1113366641065 - 27 = 1113366640937 is a prime.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3924804 + ... + 4198906.
It is an arithmetic number, because the mean of its divisors is an integer number (33044607720).
Almost surely, 21113366641065 is an apocalyptic number.
It is an amenable number.
1113366641065 is a deficient number, since it is larger than the sum of its proper divisors (472774529495).
1113366641065 is a wasteful number, since it uses less digits than its factorization.
1113366641065 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 274462 (or 274455 counting only the distinct ones).
The product of its (nonzero) digits is 233280, while the sum is 43.
The spelling of 1113366641065 in words is "one trillion, one hundred thirteen billion, three hundred sixty-six million, six hundred forty-one thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •