Base | Representation |
---|---|
bin | 100110001001000111010… |
… | …010011011111111011001 |
3 | 100021120120210010021001021 |
4 | 212021013102123333121 |
5 | 320421031233104022 |
6 | 5324043444122441 |
7 | 360240642645445 |
oct | 46110722337731 |
9 | 10246523107037 |
10 | 2621126066137 |
11 | 920682371577 |
12 | 363ba9996421 |
13 | 16022bc75717 |
14 | 90c127c1825 |
15 | 482ac89a7c7 |
hex | 2624749bfd9 |
2621126066137 has 8 divisors (see below), whose sum is σ = 2736850939200. Its totient is φ = 2507090607504.
The previous prime is 2621126066113. The next prime is 2621126066227. The reversal of 2621126066137 is 7316606211262.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2621126066137 - 231 = 2618978582489 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2621126066093 and 2621126066102.
It is not an unprimeable number, because it can be changed into a prime (2621126066107) 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, 422350437 + ... + 422356642.
It is an arithmetic number, because the mean of its divisors is an integer number (342106367400).
Almost surely, 22621126066137 is an apocalyptic number.
It is an amenable number.
2621126066137 is a deficient number, since it is larger than the sum of its proper divisors (115724873063).
2621126066137 is a wasteful number, since it uses less digits than its factorization.
2621126066137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 844707215.
The product of its (nonzero) digits is 217728, while the sum is 43.
The spelling of 2621126066137 in words is "two trillion, six hundred twenty-one billion, one hundred twenty-six million, sixty-six thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •