Base | Representation |
---|---|
bin | 100110101101110110000… |
… | …100001010111100100101 |
3 | 100102100101101111012012212 |
4 | 212231312010022330211 |
5 | 322042314240424000 |
6 | 5354125201253205 |
7 | 363135203063033 |
oct | 46556604127445 |
9 | 10370341435185 |
10 | 2660565561125 |
11 | 93638099792a |
12 | 36b776034205 |
13 | 163b75b7a0c4 |
14 | 92ab4767553 |
15 | 4931a066c35 |
hex | 26b7610af25 |
2660565561125 has 64 divisors (see below), whose sum is σ = 3513201120000. Its totient is φ = 2006028288000.
The previous prime is 2660565561119. The next prime is 2660565561217. The reversal of 2660565561125 is 5211655650662.
2660565561125 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2660565561125 - 232 = 2656270593829 is a prime.
It is a super-2 number, since 2×26605655611252 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 806474726 + ... + 806478024.
It is an arithmetic number, because the mean of its divisors is an integer number (54893767500).
Almost surely, 22660565561125 is an apocalyptic number.
2660565561125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2660565561125 is a deficient number, since it is larger than the sum of its proper divisors (852635558875).
2660565561125 is a wasteful number, since it uses less digits than its factorization.
2660565561125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4983 (or 4973 counting only the distinct ones).
The product of its (nonzero) digits is 3240000, while the sum is 50.
The spelling of 2660565561125 in words is "two trillion, six hundred sixty billion, five hundred sixty-five million, five hundred sixty-one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •