Base | Representation |
---|---|
bin | 101101110000001010101011… |
… | …111010101010100000100010 |
3 | 222101110122102021100011220020 |
4 | 231300022223322222200202 |
5 | 202333310331114200002 |
6 | 1551544054010454310 |
7 | 60245550162626064 |
oct | 5560125372524042 |
9 | 871418367304806 |
10 | 201222102100002 |
11 | 5912a8a5871295 |
12 | 1a69a236a34396 |
13 | 88382168c6169 |
14 | 37992b76a9734 |
15 | 183e3ae3252bc |
hex | b702abeaa822 |
201222102100002 has 8 divisors (see below), whose sum is σ = 402444204200016. Its totient is φ = 67074034033332.
The previous prime is 201222102099961. The next prime is 201222102100031. The reversal of 201222102100002 is 200001201222102.
201222102100002 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
201222102100002 is an admirable number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16768508508328 + ... + 16768508508339.
It is an arithmetic number, because the mean of its divisors is an integer number (50305525525002).
Almost surely, 2201222102100002 is an apocalyptic number.
201222102100002 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201222102100002 is a wasteful number, since it uses less digits than its factorization.
201222102100002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33537017016672.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 201222102100002 its reverse (200001201222102), we get a palindrome (401223303322104).
The spelling of 201222102100002 in words is "two hundred one trillion, two hundred twenty-two billion, one hundred two million, one hundred thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •