Base | Representation |
---|---|
bin | 100000000001110111000… |
… | …001110010000000010111 |
3 | 21210102012212211122011100 |
4 | 200001313001302000113 |
5 | 242030142133224343 |
6 | 4403045033441143 |
7 | 315006222051561 |
oct | 40016701620027 |
9 | 7712185748140 |
10 | 2201020211223 |
11 | 7794a158a859 |
12 | 2b66a52701b3 |
13 | 12c72b049012 |
14 | 7875c260331 |
15 | 3c3c0cc69d3 |
hex | 20077072017 |
2201020211223 has 12 divisors (see below), whose sum is σ = 3179438728960. Its totient is φ = 1467260355456.
The previous prime is 2201020211179. The next prime is 2201020211233. The reversal of 2201020211223 is 3221120201022.
2201020211223 is a `hidden beast` number, since 220 + 10 + 2 + 0 + 211 + 223 = 666.
It is not a de Polignac number, because 2201020211223 - 217 = 2201020080151 is a prime.
It is a super-3 number, since 3×22010202112233 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2201020211196 and 2201020211205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2201020211233) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7042903 + ... + 7348776.
Almost surely, 22201020211223 is an apocalyptic number.
2201020211223 is a deficient number, since it is larger than the sum of its proper divisors (978418517737).
2201020211223 is a wasteful number, since it uses less digits than its factorization.
2201020211223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14408678 (or 14408675 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 2201020211223 its reverse (3221120201022), we get a palindrome (5422140412245).
The spelling of 2201020211223 in words is "two trillion, two hundred one billion, twenty million, two hundred eleven thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •