Base | Representation |
---|---|
bin | 100110101101100001011… |
… | …110110100111001101101 |
3 | 100102022111022200102002210 |
4 | 212231201132310321231 |
5 | 322041112334232211 |
6 | 5354031023441033 |
7 | 363123510561366 |
oct | 46554136647155 |
9 | 10368438612083 |
10 | 2660220227181 |
11 | 936213a6a380 |
12 | 36b69a456179 |
13 | 163b1c4689aa |
14 | 92a80952b6d |
15 | 492e9aa09a6 |
hex | 26b617b4e6d |
2660220227181 has 32 divisors (see below), whose sum is σ = 3876491114496. Its totient is φ = 1609306776000.
The previous prime is 2660220227143. The next prime is 2660220227219. The reversal of 2660220227181 is 1817220220662.
It is an interprime number because it is at equal distance from previous prime (2660220227143) and next prime (2660220227219).
It is not a de Polignac number, because 2660220227181 - 27 = 2660220227053 is a prime.
It is a super-4 number, since 4×26602202271814 (a number of 51 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2660220227881) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 55419211 + ... + 55467191.
It is an arithmetic number, because the mean of its divisors is an integer number (121140347328).
Almost surely, 22660220227181 is an apocalyptic number.
It is an amenable number.
2660220227181 is a deficient number, since it is larger than the sum of its proper divisors (1216270887315).
2660220227181 is a wasteful number, since it uses less digits than its factorization.
2660220227181 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51033.
The product of its (nonzero) digits is 64512, while the sum is 39.
The spelling of 2660220227181 in words is "two trillion, six hundred sixty billion, two hundred twenty million, two hundred twenty-seven thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •