Base | Representation |
---|---|
bin | 101101101110011010000110… |
… | …111010100001010110010010 |
3 | 222101001002101221112002121002 |
4 | 231232122012322201112102 |
5 | 202324320300342034302 |
6 | 1551412343123302002 |
7 | 60234040520620262 |
oct | 5556320672412622 |
9 | 871032357462532 |
10 | 201101222221202 |
11 | 59093605278206 |
12 | 1a67a92051a902 |
13 | 88299c133ba64 |
14 | 37934cb5637a2 |
15 | 183b186eb9c02 |
hex | b6e686ea1592 |
201101222221202 has 8 divisors (see below), whose sum is σ = 301749486896700. Its totient is φ = 100518059922304.
The previous prime is 201101222221199. The next prime is 201101222221219. The reversal of 201101222221202 is 202122222101102.
201101222221202 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 182112622897921 + 18988599323281 = 13494911^2 + 4357591^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×2011012222212022 (a number of 29 digits) contains 22 as substring.
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, 16275586427 + ... + 16275598782.
Almost surely, 2201101222221202 is an apocalyptic number.
201101222221202 is a deficient number, since it is larger than the sum of its proper divisors (100648264675498).
201101222221202 is a wasteful number, since it uses less digits than its factorization.
201101222221202 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32551188300.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 201101222221202 its reverse (202122222101102), we get a palindrome (403223444322304).
The spelling of 201101222221202 in words is "two hundred one trillion, one hundred one billion, two hundred twenty-two million, two hundred twenty-one thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •