Base | Representation |
---|---|
bin | 101101101110011010110101… |
… | …011001001011100000001010 |
3 | 222101001011102021211110220012 |
4 | 231232122311121023200022 |
5 | 202324323400003310442 |
6 | 1551412552341031522 |
7 | 60234066036665333 |
oct | 5556326531134012 |
9 | 871034367743805 |
10 | 201102002010122 |
11 | 59093975464164 |
12 | 1a67aab96b55a2 |
13 | 8829ab6a66415 |
14 | 3793562d4b28a |
15 | 183b1d069d582 |
hex | b6e6b564b80a |
201102002010122 has 8 divisors (see below), whose sum is σ = 301846494362400. Its totient is φ = 100486503889324.
The previous prime is 201102002010097. The next prime is 201102002010163. The reversal of 201102002010122 is 221010200201102.
201102002010122 is digitally balanced in base 2, 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.
It is a super-2 number, since 2×2011020020101222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201102002010097 and 201102002010106.
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, 32248553972 + ... + 32248560207.
It is an arithmetic number, because the mean of its divisors is an integer number (37730811795300).
Almost surely, 2201102002010122 is an apocalyptic number.
201102002010122 is a deficient number, since it is larger than the sum of its proper divisors (100744492352278).
201102002010122 is a wasteful number, since it uses less digits than its factorization.
201102002010122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64497115740.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 201102002010122 its reverse (221010200201102), we get a palindrome (422112202211224).
The spelling of 201102002010122 in words is "two hundred one trillion, one hundred two billion, two million, ten thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •