Base | Representation |
---|---|
bin | 100110101110110101100… |
… | …101011100000001111101 |
3 | 100102110010122202121200010 |
4 | 212232311211130001331 |
5 | 322102010044341321 |
6 | 5354423030453433 |
7 | 363203463210255 |
oct | 46566545340175 |
9 | 10373118677603 |
10 | 2661631246461 |
11 | 9368784a5010 |
12 | 36ba12b04279 |
13 | 163cb58a4c45 |
14 | 92b760d2965 |
15 | 4937d8c0676 |
hex | 26bb595c07d |
2661631246461 has 16 divisors (see below), whose sum is σ = 4004962378560. Its totient is φ = 1557485368320.
The previous prime is 2661631246423. The next prime is 2661631246523. The reversal of 2661631246461 is 1646421361662.
It is not a de Polignac number, because 2661631246461 - 27 = 2661631246333 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2661631246461.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2661631246661) 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 15 ways as a sum of consecutive naturals, for example, 1390610980 + ... + 1390612893.
It is an arithmetic number, because the mean of its divisors is an integer number (250310148660).
Almost surely, 22661631246461 is an apocalyptic number.
It is an amenable number.
2661631246461 is a deficient number, since it is larger than the sum of its proper divisors (1343331132099).
2661631246461 is a wasteful number, since it uses less digits than its factorization.
2661631246461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2781223916.
The product of its digits is 1492992, while the sum is 48.
It can be divided in two parts, 2661631 and 246461, that added together give a palindrome (2908092).
The spelling of 2661631246461 in words is "two trillion, six hundred sixty-one billion, six hundred thirty-one million, two hundred forty-six thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •