Base | Representation |
---|---|
bin | 101101110000000000010111… |
… | …011000001111000011100110 |
3 | 222101102120210221121212101221 |
4 | 231300000113120033003212 |
5 | 202333120132122041402 |
6 | 1551535022213210554 |
7 | 60245005436400340 |
oct | 5560002730170346 |
9 | 871376727555357 |
10 | 201211020112102 |
11 | 59126129324800 |
12 | 1a698063630a5a |
13 | 883716b9c3680 |
14 | 3798945976290 |
15 | 183de6148d337 |
hex | b7001760f0e6 |
201211020112102 has 96 divisors (see below), whose sum is σ = 410561994652992. Its totient is φ = 71963803296000.
The previous prime is 201211020112099. The next prime is 201211020112103.
201211020112102 is nontrivially palindromic in base 10.
It is a super-2 number, since 2×2012110201121022 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201211020112103) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 21253849 + ... + 29225812.
It is an arithmetic number, because the mean of its divisors is an integer number (4276687444302).
Almost surely, 2201211020112102 is an apocalyptic number.
201211020112102 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
201211020112102 is an abundant number, since it is smaller than the sum of its proper divisors (209350974540890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201211020112102 is a wasteful number, since it uses less digits than its factorization.
201211020112102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50479886 (or 50479875 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
The spelling of 201211020112102 in words is "two hundred one trillion, two hundred eleven billion, twenty million, one hundred twelve thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •