Base | Representation |
---|---|
bin | 100000000010001000011… |
… | …111100010000111010001 |
3 | 21210102222022012011220212 |
4 | 200002020133202013101 |
5 | 242031242141114441 |
6 | 4403134102013505 |
7 | 315016410444635 |
oct | 40021037420721 |
9 | 7712868164825 |
10 | 2201313223121 |
11 | 779631a20a51 |
12 | 2b6767417295 |
13 | 12c77696b13c |
14 | 78789134dc5 |
15 | 3c3db8a4eeb |
hex | 200887e21d1 |
2201313223121 has 8 divisors (see below), whose sum is σ = 2243632625064. Its totient is φ = 2159022902400.
The previous prime is 2201313223079. The next prime is 2201313223169. The reversal of 2201313223121 is 1213223131022.
It can be written as a sum of positive squares in 4 ways, for example, as 514431783121 + 1686881440000 = 717239^2 + 1298800^2 .
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-2201313223121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2201313223321) 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, 7117430 + ... + 7420271.
It is an arithmetic number, because the mean of its divisors is an integer number (280454078133).
Almost surely, 22201313223121 is an apocalyptic number.
It is an amenable number.
2201313223121 is a deficient number, since it is larger than the sum of its proper divisors (42319401943).
2201313223121 is a wasteful number, since it uses less digits than its factorization.
2201313223121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14540611.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 2201313223121 its reverse (1213223131022), we get a palindrome (3414536354143).
The spelling of 2201313223121 in words is "two trillion, two hundred one billion, three hundred thirteen million, two hundred twenty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •