Base | Representation |
---|---|
bin | 100110101110100101110… |
… | …000110111000011011011 |
3 | 100102102110011021210211002 |
4 | 212232211300313003123 |
5 | 322100434121232100 |
6 | 5354340425255215 |
7 | 363164061044252 |
oct | 46564560670333 |
9 | 10372404253732 |
10 | 2661365805275 |
11 | 936751685131 |
12 | 36b95a03450b |
13 | 163c728b7158 |
14 | 92b4cb57799 |
15 | 4936543b2d5 |
hex | 26ba5c370db |
2661365805275 has 12 divisors (see below), whose sum is σ = 3300113835000. Its totient is φ = 2129079588480.
The previous prime is 2661365805269. The next prime is 2661365805277. The reversal of 2661365805275 is 5725085631662.
It is not a de Polignac number, because 2661365805275 - 26 = 2661365805211 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2661365805275.
It is not an unprimeable number, because it can be changed into a prime (2661365805277) 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 11 ways as a sum of consecutive naturals, for example, 7770851 + ... + 8106099.
It is an arithmetic number, because the mean of its divisors is an integer number (275009486250).
Almost surely, 22661365805275 is an apocalyptic number.
2661365805275 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
2661365805275 is a deficient number, since it is larger than the sum of its proper divisors (638748029725).
2661365805275 is a wasteful number, since it uses less digits than its factorization.
2661365805275 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 652798 (or 652793 counting only the distinct ones).
The product of its (nonzero) digits is 18144000, while the sum is 56.
The spelling of 2661365805275 in words is "two trillion, six hundred sixty-one billion, three hundred sixty-five million, eight hundred five thousand, two hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •