Base | Representation |
---|---|
bin | 101101101110011010111100… |
… | …011111100001001000110000 |
3 | 222101001011201120221111010000 |
4 | 231232122330133201020300 |
5 | 202324324121001041422 |
6 | 1551413012233510000 |
7 | 60234102014226423 |
oct | 5556327437411060 |
9 | 871034646844100 |
10 | 201102121112112 |
11 | 59093a26712260 |
12 | 1a67ab31572300 |
13 | 8829b0563767c |
14 | 3793574ab19ba |
15 | 183b1dad77cac |
hex | b6e6bc7e1230 |
201102121112112 has 100 divisors (see below), whose sum is σ = 634961326889736. Its totient is φ = 60940036696320.
The previous prime is 201102121112107. The next prime is 201102121112149. The reversal of 201102121112112 is 211211121201102.
It is a happy number.
201102121112112 is a `hidden beast` number, since 20 + 110 + 212 + 111 + 211 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 7053230733 + ... + 7053259244.
Almost surely, 2201102121112112 is an apocalyptic number.
201102121112112 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
201102121112112 is an abundant number, since it is smaller than the sum of its proper divisors (433859205777624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201102121112112 is a wasteful number, since it uses less digits than its factorization.
201102121112112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14106490008 (or 14106489993 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 18.
Adding to 201102121112112 its reverse (211211121201102), we get a palindrome (412313242313214).
The spelling of 201102121112112 in words is "two hundred one trillion, one hundred two billion, one hundred twenty-one million, one hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •