Base | Representation |
---|---|
bin | 11110110000011111111… |
… | …110001100010000100001 |
3 | 21111001201121202122212021 |
4 | 132300133332030100201 |
5 | 234112234014301330 |
6 | 4255000243501441 |
7 | 305464321111651 |
oct | 36603776142041 |
9 | 7431647678767 |
10 | 2113660306465 |
11 | 74544215a364 |
12 | 2a1784687881 |
13 | 124418197996 |
14 | 74431c40361 |
15 | 39eab5ea67a |
hex | 1ec1ff8c421 |
2113660306465 has 4 divisors (see below), whose sum is σ = 2536392367764. Its totient is φ = 1690928245168.
The previous prime is 2113660306427. The next prime is 2113660306477. The reversal of 2113660306465 is 5646030663112.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1036847318049 + 1076812988416 = 1018257^2 + 1037696^2 .
It is a cyclic number.
It is not a de Polignac number, because 2113660306465 - 211 = 2113660304417 is a prime.
It is a super-2 number, since 2×21136603064652 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 211366030642 + ... + 211366030651.
It is an arithmetic number, because the mean of its divisors is an integer number (634098091941).
Almost surely, 22113660306465 is an apocalyptic number.
It is an amenable number.
2113660306465 is a deficient number, since it is larger than the sum of its proper divisors (422732061299).
2113660306465 is an equidigital number, since it uses as much as digits as its factorization.
2113660306465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 422732061298.
The product of its (nonzero) digits is 466560, while the sum is 43.
Adding to 2113660306465 its reverse (5646030663112), we get a palindrome (7759690969577).
The spelling of 2113660306465 in words is "two trillion, one hundred thirteen billion, six hundred sixty million, three hundred six thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •