Base | Representation |
---|---|
bin | 100110100100011110001… |
… | …000110111111000001101 |
3 | 100101101101221020021211002 |
4 | 212210132020313320031 |
5 | 321411211104323031 |
6 | 5345342331310045 |
7 | 362330605134665 |
oct | 46443610677015 |
9 | 10341357207732 |
10 | 2650500464141 |
11 | 932086460562 |
12 | 3698272ab325 |
13 | 162c30849a0a |
14 | 923dbadb1a5 |
15 | 48e2b5eaccb |
hex | 2691e237e0d |
2650500464141 has 32 divisors (see below), whose sum is σ = 2824686708480. Its totient is φ = 2483141068800.
The previous prime is 2650500464081. The next prime is 2650500464149. The reversal of 2650500464141 is 1414640050562.
It is a happy number.
2650500464141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 2650500464141 - 214 = 2650500447757 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2650500464095 and 2650500464104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2650500464149) 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, 53340590 + ... + 53390256.
It is an arithmetic number, because the mean of its divisors is an integer number (88271459640).
Almost surely, 22650500464141 is an apocalyptic number.
It is an amenable number.
2650500464141 is a deficient number, since it is larger than the sum of its proper divisors (174186244339).
2650500464141 is a wasteful number, since it uses less digits than its factorization.
2650500464141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50165.
The product of its (nonzero) digits is 115200, while the sum is 38.
The spelling of 2650500464141 in words is "two trillion, six hundred fifty billion, five hundred million, four hundred sixty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •