Base | Representation |
---|---|
bin | 110000000000000101100011… |
… | …101100011101110010001010 |
3 | 1000200111010111012120102110012 |
4 | 300000011203230131302022 |
5 | 210132330241211213002 |
6 | 2024555334510351522 |
7 | 62316232056601214 |
oct | 6000054354356212 |
9 | 1020433435512405 |
10 | 211112200101002 |
11 | 612a31aa300862 |
12 | 1b816b607bb5a2 |
13 | 90a4a44948435 |
14 | 3a1bc566455b4 |
15 | 19617a5a7cd52 |
hex | c00163b1dc8a |
211112200101002 has 32 divisors (see below), whose sum is σ = 317431440145344. Its totient is φ = 105302007504000.
The previous prime is 211112200101001. The next prime is 211112200101013. The reversal of 211112200101002 is 200101002211112.
It is a super-2 number, since 2×2111122001010022 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (211112200101001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18449019893 + ... + 18449031335.
It is an arithmetic number, because the mean of its divisors is an integer number (9919732504542).
Almost surely, 2211112200101002 is an apocalyptic number.
211112200101002 is a deficient number, since it is larger than the sum of its proper divisors (106319240044342).
211112200101002 is a wasteful number, since it uses less digits than its factorization.
211112200101002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22134.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 211112200101002 its reverse (200101002211112), we get a palindrome (411213202312114).
It can be divided in two parts, 211112 and 200101002, that multiplied together give a palindrome (42243722734224).
The spelling of 211112200101002 in words is "two hundred eleven trillion, one hundred twelve billion, two hundred million, one hundred one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •