Base | Representation |
---|---|
bin | 100000000101010011111… |
… | …011000110111011111001 |
3 | 21210202210011100201122010 |
4 | 200011103323012323321 |
5 | 242110234403223211 |
6 | 4404500502320133 |
7 | 315200112501426 |
oct | 40052373067371 |
9 | 7722704321563 |
10 | 2204726226681 |
11 | 780023529050 |
12 | 2b735a429049 |
13 | 12cb9ba97984 |
14 | 789d0528d4d |
15 | 3c53b32a4a6 |
hex | 20153ec6ef9 |
2204726226681 has 8 divisors (see below), whose sum is σ = 3206874511584. Its totient is φ = 1336197713120.
The previous prime is 2204726226679. The next prime is 2204726226719. The reversal of 2204726226681 is 1866226274022.
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 2204726226681 - 21 = 2204726226679 is a prime.
It is a super-2 number, since 2×22047262266812 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2204726226681.
It is not an unprimeable number, because it can be changed into a prime (2204726226181) 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, 33404942796 + ... + 33404942861.
It is an arithmetic number, because the mean of its divisors is an integer number (400859313948).
Almost surely, 22204726226681 is an apocalyptic number.
It is an amenable number.
2204726226681 is a deficient number, since it is larger than the sum of its proper divisors (1002148284903).
2204726226681 is a wasteful number, since it uses less digits than its factorization.
2204726226681 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66809885671.
The product of its (nonzero) digits is 1548288, while the sum is 48.
The spelling of 2204726226681 in words is "two trillion, two hundred four billion, seven hundred twenty-six million, two hundred twenty-six thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •