Base | Representation |
---|---|
bin | 101101101110011010000110… |
… | …010000000110001111010000 |
3 | 222101001002101011121002022212 |
4 | 231232122012100012033100 |
5 | 202324320240020200422 |
6 | 1551412342045051252 |
7 | 60234040324241261 |
oct | 5556320620061720 |
9 | 871032334532285 |
10 | 201101211100112 |
11 | 590935a9a71824 |
12 | 1a67a918856b28 |
13 | 88299bbc46b2b |
14 | 37934c9caa968 |
15 | 183b18601e9e2 |
hex | b6e6864063d0 |
201101211100112 has 10 divisors (see below), whose sum is σ = 389633596506498. Its totient is φ = 100550605550048.
The previous prime is 201101211099989. The next prime is 201101211100157. The reversal of 201101211100112 is 211001112101102.
201101211100112 is digitally balanced in base 3, 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 only one way, i.e., 105802536593296 + 95298674506816 = 10286036^2 + 9762104^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6284412846863 + ... + 6284412846894.
Almost surely, 2201101211100112 is an apocalyptic number.
It is an amenable number.
201101211100112 is a deficient number, since it is larger than the sum of its proper divisors (188532385406386).
201101211100112 is a wasteful number, since it uses less digits than its factorization.
201101211100112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12568825693765 (or 12568825693759 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 201101211100112 its reverse (211001112101102), we get a palindrome (412102323201214).
The spelling of 201101211100112 in words is "two hundred one trillion, one hundred one billion, two hundred eleven million, one hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •