Base | Representation |
---|---|
bin | 100000000001111110000… |
… | …100010010111011001001 |
3 | 21210102112010001201101212 |
4 | 200001332010102323021 |
5 | 242030412401421412 |
6 | 4403104453022505 |
7 | 315012154636433 |
oct | 40017604227311 |
9 | 7712463051355 |
10 | 2201138310857 |
11 | 779552213862 |
12 | 2b6718924a35 |
13 | 12c749658c65 |
14 | 7876dc03653 |
15 | 3c3cb354222 |
hex | 2007e112ec9 |
2201138310857 has 4 divisors (see below), whose sum is σ = 2201144470980. Its totient is φ = 2201132150736.
The previous prime is 2201138310853. The next prime is 2201138310887. The reversal of 2201138310857 is 7580138311022.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 533000744761 + 1668137566096 = 730069^2 + 1291564^2 .
It is a cyclic number.
It is not a de Polignac number, because 2201138310857 - 22 = 2201138310853 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2201138310853) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2508758 + ... + 3270495.
It is an arithmetic number, because the mean of its divisors is an integer number (550286117745).
Almost surely, 22201138310857 is an apocalyptic number.
It is an amenable number.
2201138310857 is a deficient number, since it is larger than the sum of its proper divisors (6160123).
2201138310857 is an equidigital number, since it uses as much as digits as its factorization.
2201138310857 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6160122.
The product of its (nonzero) digits is 80640, while the sum is 41.
The spelling of 2201138310857 in words is "two trillion, two hundred one billion, one hundred thirty-eight million, three hundred ten thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •