Base | Representation |
---|---|
bin | 100101110101011100111… |
… | …000110110001110011001 |
3 | 100012120002102022212202020 |
4 | 211311130320312032121 |
5 | 320044311441320441 |
6 | 5310232455125053 |
7 | 355562522060631 |
oct | 45653470661631 |
9 | 10176072285666 |
10 | 2600013620121 |
11 | 9127289a7385 |
12 | 35ba97373789 |
13 | 15b245c80108 |
14 | 8dbac87b6c1 |
15 | 4797413ae66 |
hex | 25d5ce36399 |
2600013620121 has 8 divisors (see below), whose sum is σ = 3532093974720. Its totient is φ = 1700637839472.
The previous prime is 2600013620107. The next prime is 2600013620129. The reversal of 2600013620121 is 1210263100062.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2600013620121 - 223 = 2600005231513 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2600013620091 and 2600013620100.
It is not an unprimeable number, because it can be changed into a prime (2600013620129) 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 7 ways as a sum of consecutive naturals, for example, 8176143301 + ... + 8176143618.
It is an arithmetic number, because the mean of its divisors is an integer number (441511746840).
Almost surely, 22600013620121 is an apocalyptic number.
It is an amenable number.
2600013620121 is a deficient number, since it is larger than the sum of its proper divisors (932080354599).
2600013620121 is a wasteful number, since it uses less digits than its factorization.
2600013620121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16352286975.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 2600013620121 its reverse (1210263100062), we get a palindrome (3810276720183).
The spelling of 2600013620121 in words is "two trillion, six hundred billion, thirteen million, six hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •