Base | Representation |
---|---|
bin | 101101110000001000110101… |
… | …001011110100110110101010 |
3 | 222101110110021110001121111021 |
4 | 231300020311023310312222 |
5 | 202333242241142010442 |
6 | 1551543124211323054 |
7 | 60245446624165315 |
oct | 5560106513646652 |
9 | 871413243047437 |
10 | 201220110110122 |
11 | 59129a733a5864 |
12 | 1a69997b8b048a |
13 | 8837c89cc4a1c |
14 | 3799168cd797c |
15 | 183e2e44e5e67 |
hex | b702352f4daa |
201220110110122 has 8 divisors (see below), whose sum is σ = 304818582642372. Its totient is φ = 99613915896000.
The previous prime is 201220110110077. The next prime is 201220110110143. The reversal of 201220110110122 is 221011011022102.
201220110110122 is digitally balanced in base 2, because in such base 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 174271126990041 + 26948983120081 = 13201179^2 + 5191241^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 201220110110096 and 201220110110105.
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, 498069579279 + ... + 498069579682.
Almost surely, 2201220110110122 is an apocalyptic number.
201220110110122 is a deficient number, since it is larger than the sum of its proper divisors (103598472532250).
201220110110122 is a wasteful number, since it uses less digits than its factorization.
201220110110122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 996139159064.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 201220110110122 its reverse (221011011022102), we get a palindrome (422231121132224).
The spelling of 201220110110122 in words is "two hundred one trillion, two hundred twenty billion, one hundred ten million, one hundred ten thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •