Base | Representation |
---|---|
bin | 11110110000011111111… |
… | …101110011010000100001 |
3 | 21111001201121120110101200 |
4 | 132300133331303100201 |
5 | 234112234003012230 |
6 | 4255000241351413 |
7 | 305464320204264 |
oct | 36603775632041 |
9 | 7431647513350 |
10 | 2113660204065 |
11 | 74544209a433 |
12 | 2a1784638569 |
13 | 1244181601a7 |
14 | 74431c14cdb |
15 | 39eab5ca160 |
hex | 1ec1ff73421 |
2113660204065 has 24 divisors (see below), whose sum is σ = 3699247381440. Its totient is φ = 1116340920864.
The previous prime is 2113660204063. The next prime is 2113660204069. The reversal of 2113660204065 is 5604020663112.
2113660204065 is a `hidden beast` number, since 2 + 1 + 1 + 3 + 6 + 602 + 0 + 40 + 6 + 5 = 666.
It is not a de Polignac number, because 2113660204065 - 21 = 2113660204063 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2113660204063) 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 23 ways as a sum of consecutive naturals, for example, 228006175 + ... + 228015444.
It is an arithmetic number, because the mean of its divisors is an integer number (154135307560).
Almost surely, 22113660204065 is an apocalyptic number.
It is an amenable number.
2113660204065 is a deficient number, since it is larger than the sum of its proper divisors (1585587177375).
2113660204065 is a wasteful number, since it uses less digits than its factorization.
2113660204065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 456021733 (or 456021730 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 36.
Adding to 2113660204065 its reverse (5604020663112), we get a palindrome (7717680867177).
The spelling of 2113660204065 in words is "two trillion, one hundred thirteen billion, six hundred sixty million, two hundred four thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •