Base | Representation |
---|---|
bin | 101101101110011010110101… |
… | …010001100000111111111110 |
3 | 222101001011102011001101221002 |
4 | 231232122311101200333332 |
5 | 202324323344000013042 |
6 | 1551412552230010302 |
7 | 60234066013630031 |
oct | 5556326521407776 |
9 | 871034364041832 |
10 | 201102000001022 |
11 | 5909397431174a |
12 | 1a67aab8aa6992 |
13 | 8829ab6511ac3 |
14 | 3793562987018 |
15 | 183b1d0403132 |
hex | b6e6b5460ffe |
201102000001022 has 16 divisors (see below), whose sum is σ = 302478907450752. Its totient is φ = 100275938908800.
The previous prime is 201102000001009. The next prime is 201102000001027. The reversal of 201102000001022 is 220100000201102.
It is a happy number.
It is a super-2 number, since 2×2011020000010222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201102000000994 and 201102000001012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201102000001027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 58680479 + ... + 62012922.
It is an arithmetic number, because the mean of its divisors is an integer number (18904931715672).
Almost surely, 2201102000001022 is an apocalyptic number.
201102000001022 is a deficient number, since it is larger than the sum of its proper divisors (101376907449730).
201102000001022 is a wasteful number, since it uses less digits than its factorization.
201102000001022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120695683.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 201102000001022 its reverse (220100000201102), we get a palindrome (421202000202124).
The spelling of 201102000001022 in words is "two hundred one trillion, one hundred two billion, one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •