Base | Representation |
---|---|
bin | 100101100010110000100… |
… | …001100010110100000001 |
3 | 100010122021120221221121112 |
4 | 211202300201202310001 |
5 | 314232210120222321 |
6 | 5253113045533105 |
7 | 354252236560121 |
oct | 45426041426401 |
9 | 10118246857545 |
10 | 2579941960961 |
11 | 905168a83812 |
12 | 358015414195 |
13 | 1593977a5711 |
14 | 8cc26c60c81 |
15 | 4719be67a5b |
hex | 258b0862d01 |
2579941960961 has 8 divisors (see below), whose sum is σ = 2702588505984. Its totient is φ = 2458168345600.
The previous prime is 2579941960951. The next prime is 2579941960979. The reversal of 2579941960961 is 1690691499752.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2579941960961 is a prime.
It is a super-2 number, since 2×25799419609612 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2579941960891 and 2579941960900.
It is not an unprimeable number, because it can be changed into a prime (2579941960951) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 218226365 + ... + 218238186.
It is an arithmetic number, because the mean of its divisors is an integer number (337823563248).
Almost surely, 22579941960961 is an apocalyptic number.
It is an amenable number.
2579941960961 is a deficient number, since it is larger than the sum of its proper divisors (122646545023).
2579941960961 is a wasteful number, since it uses less digits than its factorization.
2579941960961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 436464831.
The product of its (nonzero) digits is 66134880, while the sum is 68.
The spelling of 2579941960961 in words is "two trillion, five hundred seventy-nine billion, nine hundred forty-one million, nine hundred sixty thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •