Base | Representation |
---|---|
bin | 110000000001010111011010… |
… | …111100011001011010000011 |
3 | 1000200210112101002221122020012 |
4 | 300001113122330121122003 |
5 | 210140300301112041003 |
6 | 2025103553032535135 |
7 | 62325463236424652 |
oct | 6001273274313203 |
9 | 1020715332848205 |
10 | 211200100112003 |
11 | 613275065a1052 |
12 | 1b82bbb22514ab |
13 | 90b0112684872 |
14 | 3a221d469b199 |
15 | 1963bec8958d8 |
hex | c015daf19683 |
211200100112003 has 4 divisors (see below), whose sum is σ = 222315894854760. Its totient is φ = 200084305369248.
The previous prime is 211200100111963. The next prime is 211200100112081. The reversal of 211200100112003 is 300211001002112.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 211200100112003 - 218 = 211200099849859 is a prime.
It is a super-2 number, since 2×2112001001120032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211200100117003) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5557897371350 + ... + 5557897371387.
It is an arithmetic number, because the mean of its divisors is an integer number (55578973713690).
Almost surely, 2211200100112003 is an apocalyptic number.
211200100112003 is a deficient number, since it is larger than the sum of its proper divisors (11115794742757).
211200100112003 is a wasteful number, since it uses less digits than its factorization.
211200100112003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11115794742756.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 211200100112003 its reverse (300211001002112), we get a palindrome (511411101114115).
The spelling of 211200100112003 in words is "two hundred eleven trillion, two hundred billion, one hundred million, one hundred twelve thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •