Base | Representation |
---|---|
bin | 101101101110011001111001… |
… | …110011001111101011010010 |
3 | 222101001001211121112100222010 |
4 | 231232121321303033223102 |
5 | 202324314323031210002 |
6 | 1551412305223523350 |
7 | 60234032206556226 |
oct | 5556317163175322 |
9 | 871031747470863 |
10 | 201101002210002 |
11 | 59093502067574 |
12 | 1a67a87a8b9556 |
13 | 882998789920b |
14 | 37934aa252786 |
15 | 183b172a0b46c |
hex | b6e679ccfad2 |
201101002210002 has 16 divisors (see below), whose sum is σ = 402300607559040. Its totient is φ = 67017233546832.
The previous prime is 201101002209977. The next prime is 201101002210021. The reversal of 201101002210002 is 200012200101102.
It is a super-2 number, since 2×2011010022100022 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 201101002210002.
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 7 ways as a sum of consecutive naturals, for example, 4108437613 + ... + 4108486560.
It is an arithmetic number, because the mean of its divisors is an integer number (25143787972440).
Almost surely, 2201101002210002 is an apocalyptic number.
201101002210002 is an abundant number, since it is smaller than the sum of its proper divisors (201199605349038).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201101002210002 is a wasteful number, since it uses less digits than its factorization.
201101002210002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8216928257.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 201101002210002 its reverse (200012200101102), we get a palindrome (401113202311104).
The spelling of 201101002210002 in words is "two hundred one trillion, one hundred one billion, two million, two hundred ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •