Base | Representation |
---|---|
bin | 101101110000001010110001… |
… | …110000001000001010110001 |
3 | 222101110122200002120002002120 |
4 | 231300022301300020022301 |
5 | 202333311031200014301 |
6 | 1551544111425104453 |
7 | 60245552462030241 |
oct | 5560126160101261 |
9 | 871418602502076 |
10 | 201222200001201 |
11 | 5912a946059975 |
12 | 1a69a263788129 |
13 | 8838230c83572 |
14 | 37992c66b1b21 |
15 | 183e3b7c12e36 |
hex | b702b1c082b1 |
201222200001201 has 8 divisors (see below), whose sum is σ = 270408835697664. Its totient is φ = 133091848819440.
The previous prime is 201222200001167. The next prime is 201222200001203. The reversal of 201222200001201 is 102100002222102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201222200001201 - 217 = 201222199870129 is a prime.
It is not an unprimeable number, because it can be changed into a prime (201222200001203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 264071128230 + ... + 264071128991.
It is an arithmetic number, because the mean of its divisors is an integer number (33801104462208).
Almost surely, 2201222200001201 is an apocalyptic number.
It is an amenable number.
201222200001201 is a deficient number, since it is larger than the sum of its proper divisors (69186635696463).
201222200001201 is a wasteful number, since it uses less digits than its factorization.
201222200001201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 528142257351.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 201222200001201 its reverse (102100002222102), we get a palindrome (303322202223303).
The spelling of 201222200001201 in words is "two hundred one trillion, two hundred twenty-two billion, two hundred million, one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •