Base | Representation |
---|---|
bin | 101101110000000001010111… |
… | …110000000100001111110111 |
3 | 222101102200121012210222210212 |
4 | 231300001113300010033313 |
5 | 202333124340111213421 |
6 | 1551535321313140035 |
7 | 60245044262220341 |
oct | 5560012760041767 |
9 | 871380535728725 |
10 | 201212100101111 |
11 | 59126632a11500 |
12 | 1a69830525a61b |
13 | 88372b1688c18 |
14 | 3798a09186291 |
15 | 183dec61bee5b |
hex | b70057c043f7 |
201212100101111 has 12 divisors (see below), whose sum is σ = 224792707965672. Its totient is φ = 179921400978000.
The previous prime is 201212100101081. The next prime is 201212100101191. The reversal of 201212100101111 is 111101001212102.
It is a de Polignac number, because none of the positive numbers 2k-201212100101111 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201212100101191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13630401785 + ... + 13630416546.
It is an arithmetic number, because the mean of its divisors is an integer number (18732725663806).
Almost surely, 2201212100101111 is an apocalyptic number.
201212100101111 is a deficient number, since it is larger than the sum of its proper divisors (23580607864561).
201212100101111 is a wasteful number, since it uses less digits than its factorization.
201212100101111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27260818414 (or 27260818403 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 201212100101111 its reverse (111101001212102), we get a palindrome (312313101313213).
The spelling of 201212100101111 in words is "two hundred one trillion, two hundred twelve billion, one hundred million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •