Base | Representation |
---|---|
bin | 1001100110011101011001… |
… | …11110101010000001110001 |
3 | 2202202100111000112100010120 |
4 | 10303032230332222001301 |
5 | 10231402220042203230 |
6 | 112523005223520453 |
7 | 4306224361052241 |
oct | 463165476520161 |
9 | 82670430470116 |
10 | 21112666366065 |
11 | 67aa91683735a |
12 | 244b9392b9129 |
13 | ba1bba2b7b71 |
14 | 52dc03a43b21 |
15 | 2692c7834310 |
hex | 1333acfaa071 |
21112666366065 has 32 divisors (see below), whose sum is σ = 37649832289920. Its totient is φ = 10039955272704.
The previous prime is 21112666366039. The next prime is 21112666366069. The reversal of 21112666366065 is 56066366621112.
It is not a de Polignac number, because 21112666366065 - 226 = 21112599257201 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a junction number, because it is equal to n+sod(n) for n = 21112666365999 and 21112666366017.
It is not an unprimeable number, because it can be changed into a prime (21112666366069) 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 31 ways as a sum of consecutive naturals, for example, 2178804894 + ... + 2178814583.
It is an arithmetic number, because the mean of its divisors is an integer number (1176557259060).
Almost surely, 221112666366065 is an apocalyptic number.
It is an amenable number.
21112666366065 is a deficient number, since it is larger than the sum of its proper divisors (16537165923855).
21112666366065 is a wasteful number, since it uses less digits than its factorization.
21112666366065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4357619521.
The product of its (nonzero) digits is 2799360, while the sum is 51.
The spelling of 21112666366065 in words is "twenty-one trillion, one hundred twelve billion, six hundred sixty-six million, three hundred sixty-six thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •