Base | Representation |
---|---|
bin | 101101101110101011100111… |
… | …011010100101110011110010 |
3 | 222101002212221001221121000211 |
4 | 231232223213122211303302 |
5 | 202330122300401010002 |
6 | 1551425132344534334 |
7 | 60235304416550251 |
oct | 5556534732456362 |
9 | 871085831847024 |
10 | 201120021110002 |
11 | 590a0581801645 |
12 | 1a6824a81813aa |
13 | 882b6c8c234b7 |
14 | 379439210a798 |
15 | 183b8d757add7 |
hex | b6eae76a5cf2 |
201120021110002 has 64 divisors (see below), whose sum is σ = 313098394291200. Its totient is φ = 96837427960000.
The previous prime is 201120021109963. The next prime is 201120021110081. The reversal of 201120021110002 is 200011120021102.
It is a super-2 number, since 2×2011200211100022 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 3965040213 + ... + 3965090935.
It is an arithmetic number, because the mean of its divisors is an integer number (4892162410800).
Almost surely, 2201120021110002 is an apocalyptic number.
201120021110002 is a deficient number, since it is larger than the sum of its proper divisors (111978373181198).
201120021110002 is a wasteful number, since it uses less digits than its factorization.
201120021110002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53199.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 201120021110002 its reverse (200011120021102), we get a palindrome (401131141131104).
The spelling of 201120021110002 in words is "two hundred one trillion, one hundred twenty billion, twenty-one million, one hundred ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •