Base | Representation |
---|---|
bin | 101101101110011001111001… |
… | …101011100111101010101000 |
3 | 222101001001211110202211000011 |
4 | 231232121321223213222220 |
5 | 202324314322023223422 |
6 | 1551412305113021304 |
7 | 60234032153562451 |
oct | 5556317153475250 |
9 | 871031743684004 |
10 | 201101000211112 |
11 | 59093500a217a1 |
12 | 1a67a87a0b4834 |
13 | 8829987349441 |
14 | 37934a9c92128 |
15 | 183b172764077 |
hex | b6e679ae7aa8 |
201101000211112 has 8 divisors (see below), whose sum is σ = 377064375395850. Its totient is φ = 100550500105552.
The previous prime is 201101000211103. The next prime is 201101000211127. The reversal of 201101000211112 is 211112000101102.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 153133546581796 + 47967453629316 = 12374714^2 + 6925854^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-2 number, since 2×2011010002111122 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201101000211092 and 201101000211101.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 12568812513187 + ... + 12568812513202.
Almost surely, 2201101000211112 is an apocalyptic number.
It is an amenable number.
201101000211112 is a deficient number, since it is larger than the sum of its proper divisors (175963375184738).
201101000211112 is a wasteful number, since it uses less digits than its factorization.
201101000211112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25137625026395 (or 25137625026391 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 201101000211112 its reverse (211112000101102), we get a palindrome (412213000312214).
The spelling of 201101000211112 in words is "two hundred one trillion, one hundred one billion, two hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •