Base | Representation |
---|---|
bin | 100000000001111000000… |
… | …001110101000110101101 |
3 | 21210102021001102122120212 |
4 | 200001320001311012231 |
5 | 242030210433014013 |
6 | 4403050433352205 |
7 | 315006514551005 |
oct | 40017001650655 |
9 | 7712231378525 |
10 | 2201037001133 |
11 | 779500008313 |
12 | 2b66aaa08665 |
13 | 12c731677289 |
14 | 78760591005 |
15 | 3c3c24e16a8 |
hex | 200780751ad |
2201037001133 has 4 divisors (see below), whose sum is σ = 2201123501148. Its totient is φ = 2200950501120.
The previous prime is 2201037001123. The next prime is 2201037001151. The reversal of 2201037001133 is 3311007301022.
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 1703395640164 + 497641360969 = 1305142^2 + 705437^2 .
It is a cyclic number.
It is not a de Polignac number, because 2201037001133 - 212 = 2201036997037 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2201037001099 and 2201037001108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2201037001103) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 43211828 + ... + 43262733.
It is an arithmetic number, because the mean of its divisors is an integer number (550280875287).
Almost surely, 22201037001133 is an apocalyptic number.
It is an amenable number.
2201037001133 is a deficient number, since it is larger than the sum of its proper divisors (86500015).
2201037001133 is an equidigital number, since it uses as much as digits as its factorization.
2201037001133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 86500014.
The product of its (nonzero) digits is 756, while the sum is 23.
The spelling of 2201037001133 in words is "two trillion, two hundred one billion, thirty-seven million, one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •